Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons™

Open Access. Powered by Scholars. Published by Universities.®

Scheduling

Discipline
Institution
Publication Year
Publication
Publication Type

Articles 61 - 90 of 93

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez Apr 2011

Random Keys Genetic Algorithms Scheduling And Rescheduling Systems For Common Production Systems, Elkin Rodriguez-Velasquez

Engineering Management & Systems Engineering Theses & Dissertations

The majority of scheduling research deals with problems in specific production environments with specific objective functions. However, in many cases, more than one problem type and/or objective function exists, resulting in the need for a more generic and flexible system to generate schedules. Furthermore, most of the published scheduling research focuses on creating an optimal or near optimal initial schedule during the planning phase. However, after production processes start, circumstances like machine breakdowns, urgent jobs, and other unplanned events may render the schedule suboptimal, obsolete or even infeasible resulting in a "rescheduling" problem, which is typically also addressed for a …

Go to article

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan Apr 2011

Optimization Models And Approximate Algorithms For The Aerial Refueling Scheduling And Rescheduling Problems, Sezgin Kaplan

Engineering Management & Systems Engineering Theses & Dissertations

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with release times and due date-to-deadline window. ARSP assumes that the jobs have different release times, due dates, and due date-to-deadline windows between the refueling due date and a deadline to return without refueling. The Aerial Refueling Rescheduling Problem (ARRP), on the other hand, can be defined as updating the existing AR schedule after being disrupted by job related events including the …

Go to article

Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau Aug 2010

Decentralized Resource Allocation And Scheduling Via Walrasian Auctions With Negotiable Agents, Huaxing Chen, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper is concerned with solving decentralized resource allocation and scheduling problems via auctions with negotiable agents by allowing agents to switch their bid generation strategies within the auction process, such that a better system wide performance is achieved on average as compared to the conventional walrasian auction running with agents of fixed bid generation strategy. We propose a negotiation mechanism embedded in auctioneer to solicit bidders’ change of strategies in the process of auction. Finally we benchmark our approach against conventional auctions subject to the real-time large-scale dynamic resource coordination problem to demonstrate the effectiveness of our approach.

Go to article

A Sensitivity Analysis Of Scheduling Changes On Flight Training Resource Utilization Using Discrete Event Simulation, Melissa A. Findlay Apr 2009

A Sensitivity Analysis Of Scheduling Changes On Flight Training Resource Utilization Using Discrete Event Simulation, Melissa A. Findlay

Master's Theses - Daytona Beach

This study presented a scheduling model of the Flight Training Department at Embry Riddle Aeronautical University's Daytona Beach Campus built using ARENA 12.0. The purpose of the study was to determine if the Flight Training Department system was sensitive to changes in the resources available to students in Flight Training Device (FTD) course modules. Historical data from the Flight Training Department was used to build the model. As no significant difference was found between the actual real world system and the model for the number of active students and for the time it took students to complete the program, the …

Go to article

Project Scheduling To Maximize Positive Impacts Of Reconstruction Operations, Andrew D. Chaney Mar 2009

Project Scheduling To Maximize Positive Impacts Of Reconstruction Operations, Andrew D. Chaney

Theses and Dissertations

Since the decline of the Cold War, the risk of major conflict between powerful industrialized nations has significantly decreased. Insecurity in the twenty-first century is forecast to arise rather from the debris of imploding states. Such situations may require intervention | military or otherwise | by concerned states, and the frequency with which these interventions occur is increasing. To meet this new operational challenge, the US military must adapt its planning procedures to account for Security, Stabilization, Transition, and Reconstruction Operations (SSTRO). This research develops a project scheduling based framework for post-conflict reconstruction that prioritizes and schedules reconstruction activities in …

Go to article

Summer Sessions Breakdown Of Course Dates And Time, Paul Savory Nov 2008

Summer Sessions Breakdown Of Course Dates And Time, Paul Savory

Department of Industrial and Management Systems Engineering: Faculty Publications

This report highlights an exhaustive analysis of the hundreds of Summer Session courses to develop an understanding of when they occur during the day and during which of the four academic terms. The analysis shows that the most popular time for scheduling courses is between 9:30 am and noon for each of the four summer session terms. Given the limited number of general purpose classrooms on campus, accommodating faculty preference for rooms, buildings, and computer equipment is sometimes not possible during the most in demand course times. The results also showcase the potential for having summer courses four-day per week …

Go to article

Modeling Systems For Optimal Resource Allocation, Scheduling, And Decision Making, Esengul Tayfur Aug 2008

Modeling Systems For Optimal Resource Allocation, Scheduling, And Decision Making, Esengul Tayfur

All Dissertations

This dissertation focuses on the resource requirements and scheduling problem for logistic systems. We investigate solutions to this problem in two different logistic systems: logistic system of the health care facilities during emergency evacuations and delivery and distribution system of production industries. All hospitals must have an evacuation plan to ensure the safety of patients and prevent the loss of life. However, hospital operators have not been able to quantify how resource availability, the cost of acquiring those resources, and evacuation completion time are related. This research addresses this problem and contributes two methodologies to solve this problem. In the …

Go to article

Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa Aug 2008

Dynamic Allocation Of Airline Check-In Counters: A Queueing Optimisation Approach, Mahmut Parlar, Sharafali Moosa

Research Collection Lee Kong Chian School Of Business

This paper was motivated by an observation in an international airport with regard to allocation of resources for check-in counters. In an exclusive check-in counter system, each flight has a dedicated number of counters that will be open until at least a half-hour before the scheduled departure of that flight. Currently, in many of the airports around the world, the decision to open or close check-in counters is done on an ad hoc basis by human schedulers. In doing so, the schedulers are almost always forced to perform a balancing act in meeting the quality of service stipulated by the …

Go to article

In-House Development Of Scheduling Decision Support Systems: Case Study For Scheduling Semiconductor Device Test Operations, Tali Freed, K. H. Doerr, T. Chang Nov 2007

In-House Development Of Scheduling Decision Support Systems: Case Study For Scheduling Semiconductor Device Test Operations, Tali Freed, K. H. Doerr, T. Chang

Industrial and Manufacturing Engineering

Most manufacturing processes can benefit from an automated scheduling system. However;: the design of a fast, computerised scheduling system that achieves high-quality results and requires minimal resources is a difficult undertaking. Efficient .. scheduling of a semiconductor device test facility requires an information system that provides good schedules quickly. Semiconductor device testing-is the last stage of the long semiconductor manufacturing process, and therefore. is subjected to customer service pressures. The cost of an off-the-shelf computerised scheduling system may he prohibitive for many companies. In addition, many companies are taken aback by other characteristics of off-the-shelf scheduling systems, such as code …

Go to article

Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau Mar 2007

Efficient Algorithms For Machine Scheduling Problems With Earliness And Tardiness Penalties, Guang Feng, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

In this paper, we study the multi-machine scheduling problem with earliness and tardiness penalties and sequence dependent setup times. This problem can be decomposed into two subproblems—sequencing and timetabling. Sequencing focuses on assigning each job to a fixed machine and determine the job sequence on each machine. We call such assignment a semi-schedule. Timetabling focuses on finding an executable schedule from the semi-schedule via idle-time insertion. Sequencing is strongly NP-hard in general. Although timetabling is polynomial-time solvable, it can become a computational bottleneck if the procedure is executed many times within a larger framework. This paper makes two contributions. We …

Go to article

Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia Jan 2007

Exact And Heuristic Algorithms For The Job Shop Scheduling Problem With Earliness And Tardiness Over A Common Due Date, Leonardo Bedoya-Valencia

Engineering Management & Systems Engineering Theses & Dissertations

Scheduling has turned out to be a fundamental activity for both production and service organizations. As competitive markets emerge, Just-In-Time (JIT) production has obtained more importance as a way of rapidly responding to continuously changing market forces. Due to their realistic assumptions, job shop production environments have gained much research effort among scheduling researchers. This research develops exact and heuristic methods and algorithms to solve the job shop scheduling problem when the objective is to minimize both earliness and tardiness costs over a common due date. The objective function of minimizing earliness and tardiness costs captures the essence of the …

Go to article

A Robust Reactive Scheduling System With Application To Parallel Machine Scheduling, Jean-Paul M. Arnaout Jan 2006

A Robust Reactive Scheduling System With Application To Parallel Machine Scheduling, Jean-Paul M. Arnaout

Engineering Management & Systems Engineering Theses & Dissertations

In this turbulent world, scheduling role has become crucial in most manufacturing production, and service systems. It allows the allocation of limited resources to activities with the objective of optimizing one performance measure or more. Resources may be machines in a factory, operating rooms in a hospital, or employees in a company, while activities can be jobs in a manufacturing plant, surgeries in a hospital, or paper work in a company. The goal of each schedule is to optimize some performance measures, which could be the minimization of the schedule makespan, the jobs' completion times, jobs' earliness and tardiness, among …

Go to article

Optimization Model For Base-Level Delivery Routes And Crew Scheduling, Young-Ho Cha Mar 2005

Optimization Model For Base-Level Delivery Routes And Crew Scheduling, Young-Ho Cha

Theses and Dissertations

In the U.S. Air Force, a Logistic Readiness Squadron (LRS) provides material management, distribution, and oversight of contingency operations. Dispatchers in the LRS must quickly prepare schedules that meet the needs of their customers while dealing with real-world constraints, such as time windows, delivery priorities, and intermittent recurring missions. Currently, LRS vehicle operation elements are faced with a shortage of manpower and lack an efficient scheduling algorithm and tool. The purpose of this research is to enhance the dispatchers' capability to handle flexible situations and produce "good" schedules within current manpower restrictions. In this research, a new scheduling model and …

Go to article

Evaluation Of Scheduling Strategies On The Performance Of A Flexible Manufacturing Cell:A Simulation Study, Amr Arisha, Paul Young, Mohie El Baradie Jan 2003

Evaluation Of Scheduling Strategies On The Performance Of A Flexible Manufacturing Cell:A Simulation Study, Amr Arisha, Paul Young, Mohie El Baradie

Conference papers

The current trend in semiconductor manufacturing is characterized by expanding product variety, decreasing lead times from order to delivery, exacting standards of quality, and competitive prices. One possible means of achieving this is in the form of increased flexibility. Providing flexibility is typically an expensive proposition so, industrial engineers aim to provide more economic approaches to enable flexible manufacturing cells and related equipment to operate appropriately in an efficient manner. It is essential to characterize these tools in detail before the production plans are finalized. Using state-of-the-art computer simulation, a generic model of photolithography tools has been developed. The model …

Go to article

A Combined Adaptive Tabu Search And Set Partitioning Approach For The Crew Scheduling Problem With An Air Tanker Crew Application, Todd E. Combs Aug 2002

A Combined Adaptive Tabu Search And Set Partitioning Approach For The Crew Scheduling Problem With An Air Tanker Crew Application, Todd E. Combs

Theses and Dissertations

This research develops the first metaheuristic approach to the complete air crew scheduling problem. It develops the first dynamic, integrated, set-partitioning based vocabulary scheme for metaheuristic search. Since no benchmark flight schedules exist for the tanker crew scheduling problem, this research defines and develops a Java™ based flight schedule generator. The robustness of the tabu search algorithms is judged by testing them using designed experiments. An integer program is developed to calculate lower bounds for the tanker crew scheduling problem objectives and to measure the overall quality of solutions produced by the developed algorithms.

Go to article

A Value Focused Thinking Approach To Academic Course Scheduling, Shane A. Knighton Mar 1998

A Value Focused Thinking Approach To Academic Course Scheduling, Shane A. Knighton

Theses and Dissertations

In 1997, the School of Engineering of the United States Air Force Institute of Technology began exploring ways of automating the academic course scheduling process. The administration desired an expedient approach for course scheduling which supports the institute's mission of "providing scientific and technological education" to officers from all branches of military service, as well as international military forces. The scheduling approach needed to be flexible, efficient, and represent the institute's values and principles. Decision Analysis (DA) and specifically, Value Focused Thinking (VFT), is used to decompose the complex problem of academic course scheduling and determine the factors that are …

Go to article

A Robust Unit Commitment Algorithm For Hydro-Thermal Optimization, Chao-An Li, R. B. Johnson, A. J. Svoboda, Chung-Li Tseng, E. Hsu Jan 1998

A Robust Unit Commitment Algorithm For Hydro-Thermal Optimization, Chao-An Li, R. B. Johnson, A. J. Svoboda, Chung-Li Tseng, E. Hsu

Engineering Management and Systems Engineering Faculty Research & Creative Works

This paper presents a unit commitment algorithm which combines the Lagrangian relaxation (LR), sequential unit commitment (SUC), and optimal unit decommitment (UD) methods to solve a general hydro-thermal optimization (HTO) problem. We argue that this approach retains the advantages of the LR method while addressing the method''s observed weaknesses to improve overall algorithm performance and quality of solution. The proposed approach has been implemented in a version of PG&E''s HTO program, and test results are presented.

Go to article

A Transmission-Constrained Unit Commitment Method, Chung-Li Tseng, Chao-An Li, S. S. Oren, C. S. Cheng, A. J. Svoboda, R. B. Johnson Jan 1998

A Transmission-Constrained Unit Commitment Method, Chung-Li Tseng, Chao-An Li, S. S. Oren, C. S. Cheng, A. J. Svoboda, R. B. Johnson

Engineering Management and Systems Engineering Faculty Research & Creative Works

The paper presents a transmission-constrained unit commitment method using a Lagrangian relaxation approach. The transmission constraints are modeled as linear constraints based on a DC power flow model. The transmission constraints, as well as the demand and spinning reserve constraints, are relaxed by attaching Lagrange multipliers. The authors take a new approach in the algorithmic scheme. A three-phase algorithm is devised including dual optimization, a feasibility phase and unit decommitment. A test problem involving more than 2500 transmission lines and 2200 buses is tested along with other test problems

Go to article

Scheduling And Sequencing Arrivals To A Stochastic Service System, Peter M. Vanden Bosch Nov 1997

Scheduling And Sequencing Arrivals To A Stochastic Service System, Peter M. Vanden Bosch

Theses and Dissertations

Optimization of scheduled arrival times to an appointment system is approached from the perspectives of both queueing and scheduling theory. The appointment system is modeled as a one-server, first-come-first-served, transient queue with independent, distinctly distributed service times and no-show rates. If a customer does show, it is assumed to be punctual. The cost of operating the appointment system is a convex combination of customers' waiting times and the server's overtime. While techniques for finding the optimal static and dynamic schedules of arrivals have been proposed by other researchers, they mainly have focused on identical customers and strictly punctual arrivals. This …

Go to article

A Parallel Genetic-Neuro Scheduler For Job-Shop Scheduling Problems, H. C. Lee, Cihan H. Dagli Aug 1997

A Parallel Genetic-Neuro Scheduler For Job-Shop Scheduling Problems, H. C. Lee, Cihan H. Dagli

Engineering Management and Systems Engineering Faculty Research & Creative Works

Despite relentless efforts on developing new approaches, there are still large gaps between schedules generated through various planning systems, and schedules actually used in the shop floor environment. An effective schedule generation is a knowledge intensive activity requiring a comprehensive model of a factory and its environment at all times. There are four main difficulties that need to be addressed. First, job shop scheduling belongs to a class of NP-hard problems. Second, it is a highly constrained problem that changes from shop to shop. Third, scheduling decisions depend upon other decisions which are not isolated from other functions. Thus, it …

Go to article

Short-Term Resource Scheduling With Ramp Constraints [Power Generation Scheduling], Chung-Li Tseng, Chao-An Li, A. J. Svoboda, R. B. Johnson Jan 1997

Short-Term Resource Scheduling With Ramp Constraints [Power Generation Scheduling], Chung-Li Tseng, Chao-An Li, A. J. Svoboda, R. B. Johnson

Engineering Management and Systems Engineering Faculty Research & Creative Works

This paper describes a Lagrangian relaxation-based method to solve the short-term resource scheduling (STRS) problem with ramp constraints. Instead of discretizing the generation levels, the ramp rate constraints are relaxed with the system demand constraints using Lagrange multipliers. Three kinds of ramp constraints, startup, operating and shutdown ramp constraints are considered. The proposed method has been applied to solve the hydro-thermal generation scheduling problem at PG&E. An example alone with numerical results is also presented

Go to article

Procedures For Testing Deterministic Scheduling Models: A Dakota Case Study, Keith H. Mccready Mar 1996

Procedures For Testing Deterministic Scheduling Models: A Dakota Case Study, Keith H. Mccready

Theses and Dissertations

The DAKOTA scheduling system has been proposed for use in the United States Air Forces Europe's (USAFE's) Operational Support Airlift (OSA) scheduling. This thesis examines the OSA scheduling topic and reviews the relevant literature on vehicle routing, concluding that exact methods are intractable for large problem sizes. Consequently, heuristic methods must be considered. This thesis takes a detailed look at the DAKOTA heuristic. It examines the concepts of Validation, Verification and Accreditation (VV&A), particularly as they apply to heuristics and algorithms. It then defines what measures of performance may prove useful in judging heuristics and algorithms in general, and details …

Go to article

An Improved Heuristic For Intercontinental Ballistic Missile Crew Scheduling, Michael D. Shirley Jr. Dec 1994

An Improved Heuristic For Intercontinental Ballistic Missile Crew Scheduling, Michael D. Shirley Jr.

Theses and Dissertations

Creating monthly schedules for missile crews is a complex and time-consuming problem. Thousands of events must be scheduled for several hundred missile officers. The rules and regulations governing the problem are numerous, and there are currently no established measures for missile crew schedules. The scheduling software currently available only schedules a fraction of the events. The objectives of this research were to create a rule-based heuristic which could quickly produce feasible or near-feasible schedules, to make the scheduling process paperless, and to develop possible measures of effectiveness for missile crew schedules. The research was successful in each of these areas. …

Go to article

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew Jul 1994

Automated Manpower Rostering: Techniques And Experience, C. M. Khoong, Hoong Chuin Lau, L. W. Chew

Research Collection School Of Computing and Information Systems

We present ROMAN, a comprehensive, generic manpower rostering toolkit that successfully handles a wide spectrum of work policies found in service organizations. We review the use of various techniques and methodologies in the toolkit that contribute to its robustness and efficiency, and relate experience gained in addressing manpower rostering problems in industry.

Go to article

Automating Satellite Range Scheduling, S. Michael Schalck Dec 1993

Automating Satellite Range Scheduling, S. Michael Schalck

Theses and Dissertations

The objective of this study was to develop a computer based satellite range scheduling SRS algorithm to create a 24 hour satellite support schedule. The algorithms goal was to schedule as many satellite support requests as possible. An iterative heuristic approach was used to schedule satellite support requests in three successive sub problems. The first sub problem involves scheduling low altitude satellite support requests using a mixed integer programming approach. The next two sub problems each involve scheduling 12 hour blocks of medium and high altitude satellite support requests, again using a mixed integer programming approach. Fourteen 24 hour schedules …

Go to article

Set-Up Saving Schemes For Printed Circuit Boards Assembly, Oded Z. Maimon, Ezey M. Dar-El, Tali F. Carmon Oct 1993

Set-Up Saving Schemes For Printed Circuit Boards Assembly, Oded Z. Maimon, Ezey M. Dar-El, Tali F. Carmon

Industrial and Manufacturing Engineering

Focusing on a basic printed circuit board (PCB) assembly line configuration characterized by very long set-up times, we examine two scheduling methods that can significantly reduce the set-up. Both methods -the Grouped Set-Up (GSU) method that has been recently introduced in the literature and the Sequence Dependent Scheduling (SDS) method, which has not been studied in this context -are based on component commonality among PCB types. Using the typical traditional scheduling method as a benchmark, the GSU and the SDS methods are compared in terms of three performance measures: line throughput, average work-in-process (WIP) inventory level, and implementation complexity. Guidelines …

Go to article

Scheduling A Medium-Sized Manufacturing Shop: A Simulation Study, Daniel J. Mcfeely Sep 1993

Scheduling A Medium-Sized Manufacturing Shop: A Simulation Study, Daniel J. Mcfeely

Theses and Dissertations

This study examined the application of simple-to-use, low cost scheduling methods to the operating environment of a medium-sized manufacturing shop. Computer simulation was used to evaluate eighteen different scheduling algorithms, each the result of the combination of a loading and a sequencing rule; due date setting was not considered since due dates are exogenously set. The loading rules investigated were Minimum Machine Required, Lowest Average WIP, and Lowest Average Aggregate Priority Level. The sequencing rules investigated were Priority, EDD, FIS, SPT, Slack, and Slack Ratio. The scheduling algorithms were evaluated against performance measures of mean tardiness, mean flowtime, mean percentage …

Go to article

Estimating Test Range Capacity, Paul A. Mcdaniel Mar 1993

Estimating Test Range Capacity, Paul A. Mcdaniel

Theses and Dissertations

The main focus of this thesis effort was to develop a means to estimate the capacity of the test range complex at Eglin AFB, Florida. For the purposes of this study, test range capacity was defined as the maximum number of missions, of a given set, that could possibly be supported by range resources on any given day. In trying to determine this number, the complexities of the overall multi-resource constrained scheduling problem dictated a more practical approach be taken in modeling the allocation process of range resources to test missions. Therefore, a series of three single-resource, 0-1 integer programming …

Go to article

A Comparison Of Alphanumeric, Direct Manipulation Graphic, And Equivalent Interface Design For A Production Scheduling Task, Ann C. Fulop Jan 1992

A Comparison Of Alphanumeric, Direct Manipulation Graphic, And Equivalent Interface Design For A Production Scheduling Task, Ann C. Fulop

Psychology Theses & Dissertations

Scheduling is an essential factor influencing the efficiency of any production system. The effectiveness of the scheduling system depends upon the interaction of the human and machine. Thus, to effectively design the interface between the human and the machine, the human factors professional must understand scheduling behavior and the information requirements of the scheduling task. The present study modeled human scheduling behavior and determined the information requirements of the scheduling task. The study also compared alphanumeric, direct manipulation graphic, and equivalent interfaces to determine which interface best supports scheduling. The results of the study show that schedulers monitor the current …

Go to article

A Solution Methodology For The Variable-Level Scheduling Problem, Dennis R. Benson Mar 1991

A Solution Methodology For The Variable-Level Scheduling Problem, Dennis R. Benson

Theses and Dissertations

This study looked at a specific scheduling problem for a Department of Defense agency. A heuristic algorithms was developed to solve a general variable-level scheduling problem and was applied to this specific problem. This heuristic used linear programming and integer programming to find the minimum number of weekly billable hours for five alternative schedules. The best alternative schedule was further developed into a spreadsheet designed, squad level, master schedule. The result of this study was a proposed schedule that would save the United States government 8.2% of their security costs for this one part of the governmental agency. These savings …

Go to article

First Prev Next Last