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

Operations Research, Systems Engineering and Industrial Engineering Commons

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

Series

Scheduling

Discipline
Institution
Publication Year
Publication

Articles 1 - 25 of 25

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

An Optimization Model For Operating Room Scheduling To Reduce Blocking Across The Perioperative Process, Amin Abedini, Wei Li, Honghan Ye Jul 2017

An Optimization Model For Operating Room Scheduling To Reduce Blocking Across The Perioperative Process, Amin Abedini, Wei Li, Honghan Ye

Mechanical Engineering Faculty Publications

Operating room (OR) scheduling is important. Because of increasing demand for surgical services, hospitals must provide high quality care more efficiently with limited resources. When constructing the OR schedule, it is necessary to consider the availability of downstream resources, such as intensive care unit (ICU) and post anaesthesia care unit (PACU). The unavailability of downstream resources causes blockings between every two consecutive stages. In this paper we address the master surgical schedule (MSS) problem in order to minimize blockings between two consecutive stages. First, we present a blocking minimization (BM) model for the MSS by using integer programming, based on ...


Comparing Critical Chain Project Managemenet With Critical Path Method: A Case Study, Behzad Montazeri Apr 2017

Comparing Critical Chain Project Managemenet With Critical Path Method: A Case Study, Behzad Montazeri

Masters Theses & Specialist Projects

Scheduling is a major task in project management. The current scheduling technique, Critical Path Method (CPM), has been widely applied for several decades, but a large number of projects fail to be completed on time and schedule delays occur in many projects. This raises question about the validity of the current project scheduling system. Critical Chain Project Management (CCPM), derived from Theory of Constraints, is a relatively new alternative approach toward scheduling projects. This study compared CCPM and CPM to determine which scheduling method delivers a shorter project duration and has a better usage of resources. A scheduling software called ...


Capacity Planning And Production Scheduling For Aircraft Painting Operations, Xiangzhen Li, Caroline Krejci, Cameron A. Mackenzie, John K. Jackman, Guiping Hu, Charles Y. Hu, Adam A. Graunke, Gabriel A. Bumett Jan 2017

Capacity Planning And Production Scheduling For Aircraft Painting Operations, Xiangzhen Li, Caroline Krejci, Cameron A. Mackenzie, John K. Jackman, Guiping Hu, Charles Y. Hu, Adam A. Graunke, Gabriel A. Bumett

Industrial and Manufacturing Systems Engineering Conference Proceedings and Posters

Long-term capacity planning and production scheduling present significant challenges for the aviation industry. Our research has integrated three different modeling methodologies to effectively forecast future demand for aircraft painting and then assess and manage the capacity that is needed to meet these requirements. First, an innovative forecasting approach was developed in which stochastic processes were used to model aircraft demand over a selected time interval. These demand forecasts were used as inputs to an integer programming model, which was used to find optimal monthly aircraft painting schedules. This approach supports for resource allocation that is based on optimal scheduling, rather ...


Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen Dec 2016

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Information Systems

The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP ...


Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen Dec 2016

Orienteering Problem: A Survey Of Recent Variants, Solution Approaches And Applications, Aldy Gunawan, Hoong Chuin Lau, Pieter Vansteenwegen

Research Collection School Of Information Systems

The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a routing problem in which the goal is to determine a subset of nodes to visit, and in which order, so that the total collected score is maximized and a given time budget is not exceeded. A number of typical variants has been studied, such as the Team OP, the (Team) OP with Time Windows and the Time Dependent OP. Recently, a number of new variants of the OP was introduced, such as the Stochastic OP, the Generalized OP, the Arc OP ...


Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham Jun 2016

Strategic Planning For Setting Up Base Stations In Emergency Medical Systems, Supriyo Ghosh, Pradeep Varakantham

Research Collection School Of Information Systems

Emergency Medical Systems (EMSs) are an important component of public health-care services. Improving infrastructure for EMS and specifically the construction of base stations at the ”right” locations to reduce response times is the main focus of this paper. This is a computationally challenging task because of the: (a) exponentially large action space arising from having to consider combinations of potential base locations, which themselves can be significant; and (b) direct impact on the performance of the ambulance allocation problem, where we decide allocation of ambulances to bases. We present an incremental greedy approach to discover the placement of bases that ...


Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein Jun 2016

Dual Formulations For Optimizing Dec-Pomdp Controllers, Akshat Kumar, Hala Mostafa, Shlomo Zilberstein

Research Collection School Of Information Systems

Decentralized POMDP is an expressive model for multi-agent planning. Finite-state controllers (FSCs)---often used to represent policies for infinite-horizon problems---offer a compact, simple-to-execute policy representation. We exploit novel connections between optimizing decentralized FSCs and the dual linear program for MDPs. Consequently, we describe a dual mixed integer linear program (MIP) for optimizing deterministic FSCs. We exploit the Dec-POMDP structure to devise a compact MIP and formulate constraints that result in policies executable in partially-observable decentralized settings. We show analytically that the dual formulation can also be exploited within the expectation maximization (EM) framework to optimize stochastic FSCs. The resulting EM ...


Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau Jan 2012

Robust Distributed Scheduling Via Time Period Aggregation, Shih-Fen Cheng, John Tajan, Hoong Chuin Lau

Research Collection School Of Information Systems

In this paper, we evaluate whether the robustness of a market mechanism that allocates complementary resources could be improved through the aggregation of time periods in which resources are consumed. In particular, we study a multi-round combinatorial auction that is built on a general equilibrium framework. We adopt the general equilibrium framework and the particular combinatorial auction design from the literature, and we investigate the benefits and the limitation of time-period aggregation when demand-side uncertainties are introduced. By using simulation experiments on a real-life resource allocation problem from a container port, we show that, under stochastic conditions, the performance variation ...


Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau Jul 2011

Finding Robust-Under-Risk Solutions For Flowshop Scheduling, Steven O. Kimbrough, Ann Kuo, Hoong Chuin Lau

Research Collection School Of Information Systems

We propose and explore, in the context of benchmark problems for flowshop scheduling, a risk-based concept of robustness for optimization problems. This risk-based concept is in distinction to, and complements, the uncertainty-based concept employed in the field known as robust optimization. Implementation of our concept requires problem solution methods that sample the solution space intelligently and that produce large numbers of distinct sample points. With these solutions to hand, their robustness scores are easily obtained and heuristically robust solutions found. We find evolutionary computation to be effective for this purpose on these problems.


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 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.


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

Summer Sessions Breakdown Of Course Dates And Time, Paul Savory

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 ...


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 ...


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 confidentiality ...


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 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 ...


Data Mining For Production Scheduling, Sigurdur Olafsson Jan 2003

Data Mining For Production Scheduling, Sigurdur Olafsson

Industrial and Manufacturing Systems Engineering Conference Proceedings and Posters

Data mining is a fast growing field and many industrial engineering applications generate large amounts of data to which data mining techniques can be applied. In this paper we develop a data mining framework for production scheduling. This involves preprocessing of historic schedules into an appropriate data file, discovery of key scheduling concepts, and representation of the data mining results in a way that enables its use for job scheduling.


Allocation And Inventory Policies For Reels In Printed Circuit Board Assemblies, Abhishek Bandyopadhyay, Sachin Sulakhe, Sasidhar Malladi, Viveck Rao, Krishna Lakshminarasimhan, K. Jo Min Jan 2003

Allocation And Inventory Policies For Reels In Printed Circuit Board Assemblies, Abhishek Bandyopadhyay, Sachin Sulakhe, Sasidhar Malladi, Viveck Rao, Krishna Lakshminarasimhan, K. Jo Min

Industrial and Manufacturing Systems Engineering Conference Proceedings and Posters

In Printed Circuit Board (PCB) assemblies, various types of reels loaded with different components are extensively utilized. We examine the inventory and allocation policies across assembly lines when the number and size of the reels substantially affect the assembly efficiency (e.g., when the number of available slots in a chip shooter is relatively limited). Critical features of the policies are illustrated via numerical examples.


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 ...


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


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.


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


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 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.


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 ...


Application Of Distributed Knowledge Bases In Intelligent Manufacturing, Cihan H. Dagli, Gerald E. Hoffman Jan 1989

Application Of Distributed Knowledge Bases In Intelligent Manufacturing, Cihan H. Dagli, Gerald E. Hoffman

Engineering Management and Systems Engineering Faculty Research & Creative Works

The authors consider independent knowledge bases operating on separate work stations networked together within the domain of knowledge-based scheduling. The scheduling problem is addressed through distributed knowledge bases that have an ability to pass information back and forth between small knowledge bases functioning at different decision-making levels. A small manufacturing plant is conceptualized in order to experiment with this process. The general outline and areas of the manufacturing shop are shown. The domain specific area for the knowledge bases is to optimize the scheduling of work at each work station in order to meet a weekly quota. Automatic guided vehicle ...


Possible Applications Of Neural Networks In Manufacturing, S. Lammers, Cihan H. Dagli Jan 1989

Possible Applications Of Neural Networks In Manufacturing, S. Lammers, Cihan H. Dagli

Engineering Management and Systems Engineering Faculty Research & Creative Works

Summary form only given. An examination is made of the potential of neural networks and the impact of parallel processing in the design and operations of manufacturing systems. After an initial discussion on possible areas of application, an approach that integrates artificial intelligence, operations research, and neural networks for the solution of a scheduling problem is examined


Proposed Scheduling Methods For Printed Circuit Board Assembly, Tali Freed, Ezey M. Dar-El, Oded Z. Maimon Jan 1988

Proposed Scheduling Methods For Printed Circuit Board Assembly, Tali Freed, Ezey M. Dar-El, Oded Z. Maimon

Industrial and Manufacturing Engineering

The current practice in the assembly of electronic components on printed circuit boards (PCB's) is serial production, a process characterized by very long set-up times.

However. with the advent of efficient on-line process information, new production control methods are now possible. This paper proposes two new production methods - the Grouped Set-up (GSU) method and the Sequence-Dependent Scheduling (SDS) method, which can significantly reduce set-up times.

It is shown that the GSU always performs better than the SDS method in terms of total production flow (throughput). while the SDS performs better than the GSU method in terms of work-in-process (WIP ...