Reducing Boarding in a Post‐Anesthesia Care Unit

When operating room schedules in hospitals are produced, the constraints and preferences of surgeons and hospital workers are a primary consideration. The downstream impact on post‐operative bed availability is often ignored. This can lead to the boarding of patients overnight in the post‐anesthesia care unit (PACU) because intensive care unit beds are unavailable. In this paper, we apply integer programming and simulation to develop improved surgical scheduling assignments. We want to balance new surgeries with hospital discharges in order to reduce the variability of occupied beds from one day to the next and, as a result, to reduce boarding in the PACU.     

An integrated modelling approach for raw material management in a steel mill

An integrated modelling approach combining optimisation models with simulation is proposed for coordinated raw material management at steel works throughout the whole supply chain management process. The integrated model is composed of three components: ship scheduling, yard operation simulation and material blending models. The ship scheduling model determines which brands, how much and when they should be arrived, and the problem is modelled as mixed integer linear programming. The simulation model is used to simulate the whole processes from ships’ arrivals to the retrieval of the materials through the berthing and unloading the raw materials. Finally, the raw material blending model is developed for determining the brand and quantity of raw materials to be used. The proposed integrated modelling approach for raw material management has been successfully implemented and applied at steelwork to provide shipping schedules and predict future inventory levels at stock yards. By coordinating all the activities throughout the entire raw material supply chain management process, this article proposes an integrated approach to the problem and suggests a guideline by the appropriate simplification. The quantitative nature of the optimisation model and simulation facilitates an assessment of the risk factors in the supply chain, leading to an evaluation of a wide variety of scenarios and the development of multiple contingency plans. Further research is expected to supplement the ship scheduling models with heuristics for the idiosyncratic constraints of maritime transportation.     

Access to Long‐Term Care: The True Cause of Hospital Congestion?

Much attention has been paid to lengthy wait times in emergency departments (EDs) and much research has sought to improve ED performance. However, ED congestion is often caused by the inability to move patients into the wards while the wards in turn are often congested primarily due to patients waiting for a bed in a long‐term care (LTC) facility. The scheduling of clients to LTC is a complex problem that is compounded by the variety of LTC beds (different facilities and room accommodations), the presence of client choice and the competing demands of the hospital and community populations. We present a Markov decision process (MDP) model that determines the required access in order for the census of patients waiting for LTC in the hospitals to remain below a given threshold. We further present a simulation model that incorporates both hospital and community demand for LTC in order to predict the impact of implementing the policy derived from the MDP on the community client wait times and to aid in capacity planning for the future. We test the MDP policy vs. current practice as well as against a number of other proposed policy changes.     

Bi‐Criteria Scheduling of Surgical Services for an Outpatient Procedure Center

Uncertainty in the duration of surgical procedures can cause long patient wait times, poor utilization of resources, and high overtime costs. We compare several heuristics for scheduling an Outpatient Procedure Center. First, a discrete event simulation model is used to evaluate how 12 different sequencing and patient appointment time‐setting heuristics perform with respect to the competing criteria of expected patient waiting time and expected surgical suite overtime for a single day compared with current practice. Second, a bi‐criteria genetic algorithm (GA) is used to determine if better solutions can be obtained for this single day scheduling problem. Third, we investigate the efficacy of the bi‐criteria GA when surgeries are allowed to be moved to other days. We present numerical experiments based on real data from a large health care provider. Our analysis provides insight into the best scheduling heuristics, and the trade‐off between patient and health care provider‐based criteria. Finally, we summarize several important managerial insights based on our findings.     

Development of simulation-based production execution system in a shipyard: a case study for a panel block assembly shop

The management of a panel block shop in a shipyard is a complex process that entails the largest amount of work and in which many decisions are involved. Shipbuilders have considered the process as a bottleneck since every panel for every ship must be processed through the shop. The objective of this research is to carry out a materials flow analysis to maximise process productivity and to place simulation optimisation technology in the hands of decision makers, such as production planners and supervisors. In this article, a production execution planning system is proposed for panel block operations utilising discrete-event simulation and simulated annealing. The simulation model was validated using a real production scenario and the comparison showed a very favourable agreement between the actual panel shop and the simulation model. The proposed system supports production planners by general dispatching rules and optimisation to make better scheduling decisions on the shop floor. The system will provide a complete schedule that is at least as clear and accurate as any schedule currently obtained.     

Representing employee requirements in labour tour scheduling

In this paper, we use the methodology of simulation to evaluate six approaches for handling employee requirements in an LP-based labour tour scheduling heuristic. We model employee requirements both as minimum acceptable staffing levels—where understaffing is unacceptable—and as target staffing levels—where both under- and overstaffing are acceptable. For each representation of employee requirements, we evaluate forms of the heuristic that use problem-specific and problem-independent information on the costs of employee surpluses and, if appropriate, employee shortages. Over an extensive test data set, the target-staffing approach using problem-specific cost information outperformed all other procedures. Specifically, it generated schedules costing less than 87% of those developed using the approach most commonly found in the literature. Its schedules were also almost 5% cheaper than those of its closest competitor. We discuss the managerial and research implications of the findings and provide suggestions for future research.     

Bi-objective multi-resource scheduling problem for emergency relief operations

Abstract

Resource scheduling for emergency relief operations is complex as it has many constraints. However, an effective allocation and sequencing of resources are crucial for the minimization of the completion times in emergency relief operations. Despite the importance of such decisions, only a few mathematical models of emergency relief operations have been studied. This article presents a bi-objective mixed integer programming (MIP) that helps to minimize both the total weighted time of completion of the demand points and the makespan of the total emergency relief operation. A two-phase method is developed to solve the bi-objective MIP problem. Additionally, a case study of hospital network in the Melbourne metropolitan area is used to evaluate the model. The results indicate that the model can successfully support the decisions required in the optimal resource scheduling of emergency relief operations.     

The Surgical Scheduling Problem: Current Research and Future Opportunities

This paper reviews the general problem of surgical scheduling. We organize the literature based on the time frame or planning horizon of the schedule into six categories: capacity planning, process reengineering/redesign, the surgical services portfolio, procedure duration estimation, schedule construction, and schedule execution, monitoring, and control. We survey past work and suggest topics for potential future research in each of those areas.     

Centralized nurse scheduling to simultaneously improve schedule cost and nurse satisfaction

Nursing managers are faced with rising turnover and shortages of qualified nursing staff. At the same time they are under increased pressure to simultaneously increase patient care and satisfaction while reducing costs. In this study, we examine the impact of centralizing scheduling decisions across departments in a hospital. By pooling nurses from multiple units and scheduling them in one model, improved costs and reduced overtime result. Reduced overtime improves schedules for nurses. Improved satisfaction levels can positively impact turnover rates among nurses. Our results show that by using a centralized model, nursing managers in hospitals can improve the desirability of nurse schedules by approximately 34% and reduce overtime by approximately 80% while simultaneously reducing costs by just under 11%.     

Simulation-based production schedule generation

Abstract

While simulation has been used in manufacturing for many years, predominantly for facility design, it is within the last few years, that simulation languages have been developed to a point where they can be used on a day-to-day basis to generate schedules and predict their performance. This paper describes our use of different modelling techniques to develop a production schedule generation system. An example describing a system for a small- to medium-sized order producing company using SIMAN/CINEMA is included. While addressing the shortcomings of existing scheduling systems it is shown how the approach taken is a feasible way of creating a dynamic goal-driven simulation-based production scheduler. The paper does not aim to describe an ‘off the shelf’ scheduling system product, but rather to give an overview to methods, techniques and experiences which enable us rapidly to tailor a simulation-based scheduling system to the specific needs of a company.     

Improving Performance in Outpatient Appointment Services with a Simulation Optimization Approach

Outpatient health care service providers face increasing pressure to improve the quality of their service through effective scheduling of appointments. In this paper, a simulation optimization approach is used to determine optimal rules for a stochastic appointment scheduling problem. This approach allows for the consideration of more variables and factors in modeling this system than in prior studies, providing more flexibility in setting policy under various problem settings and environmental factors. Results show that the dome scheduling rule proposed in prior literature is robust, but practitioners could benefit from considering a flatter, “plateau‐dome.” The plateau–dome scheduling pattern is shown to be robust over many different performance measures and scenarios. Furthermore, because this is the first application of simulation optimization to appointment scheduling, other insights are gleaned that were not possible with prior methodologies.     

Minimizing tardiness on a single processor with sequence-dependent setup times: a simulated annealing approach

In today's fast-paced Just-In-Time and mass customization manufacturing in a sequence-dependent setup environment, the challenge of making production schedules to meet due-date requirements is becoming a more complex problem. Unfortunately, much of the research on operations scheduling problems has either ignored setup times or assumed that setup times on each machine are independent of the job sequence. This paper considers the problem of minimizing tardiness, a common measure of due-date performance, in a sequence-dependent setup environment. Simulated annealing was used to solve the sequencing problem, and its performance was compared with random search. Our experimental results show that the algorithm can find a good solution fairly quickly, and thus can rework schedules frequently to react to variations in the schedule. The algorithm is invaluable for ‘on-line’ production scheduling and ‘last-minute’ changes to production schedule. The results of this research also suggest ways in which more complex and realistic job shop environments, such as multiple machines with a higher number of jobs in the sequence, and other scheduling objectives can be modeled. This research also investigates computational aspects of simulated annealing in solving complex scheduling problems.     

COMBINED PRODUCTION AND MAINTENANCE SCHEDULING FOR A MULTIPLE‐PRODUCT,SINGLE‐ MACHINE PRODUCTION SYSTEM

Traditionally, the problems of equipment maintenance scheduling and production scheduling in a multi‐product environment have been treated independently. In this paper, we develop a Markov decision process model that simultaneously determines maintenance and production schedules for a multiple‐product, single‐machine production system, accounting for the fact that equipment condition can affect the yield of different product types differently. The problem was motivated by an application in semiconductor manufacturing. After examining structural properties of the optimal policy, we compare the combined method to an approach often used in practice. In the nearly 6,000 test problems studied, the reward from the combined method was an average of more than 25 percent greater than the reward from the traditional method.     

Supply Chain Scheduling: Distribution Systems

We study conflict and cooperation issues arising in a supply chain where a manufacturer makes products which are shipped to customers by a distributor. The manufacturer and the distributor each has an ideal schedule, determined by cost and capacity considerations. However, these two schedules are in general not well coordinated, which leads to poor overall performance. In this context, we study two practical problems. In both problems, the manufacturer focuses on minimizing unproductive time. The distributor minimizes customer cost measures in the first problem and minimizes inventory holding cost in the second problem. We first evaluate each party's conflict, which is the relative increase in cost that results from using the other party's optimal schedule. Since this conflict is often significant, we consider several practical scenarios about the level of cooperation between the manufacturer and the distributor. These scenarios define various scheduling problems for the manufacturer, the distributor, and the overall system. For each of these scheduling problems, we provide an algorithm. We demonstrate that the cost saving provided by cooperation between the decision makers is usually significant. Finally, we discuss the implications of our work for how manufacturers and distributors negotiate, coordinate, and implement their supply chain schedules in practice.     

Truck scheduling for solid waste collection in the City of Porto Alegre, Brazil

This paper considers a truck scheduling problem in the context of solid waste collection in the City of Porto Alegre, Brazil. The problem consists of designing “good” daily truck schedules over a set of previously defined collection trips, on which the trucks collect solid waste in fixed routes and empty loads in one of several operational recycling facilities in the system. These facilities are managed by cooperatives whose members are poor and not part of the mainstream economy. The main objective is to minimize the total operating and fixed truck costs. We show that the problem can be modeled as a special case of the single-depot vehicle scheduling problem, which is polynomially solvable. However, due to the social benefits of the solid waste program, it is desirable to obtain balanced assignments of collection trips unloading their cargo at the recycling facilities. We prove that the truck scheduling problem considering balanced unloading is NP-hard. A heuristic approach, incorporating an auction algorithm and a dynamic penalty method, is designed to acquire a good solution. Finally, computational experiments are conducted on real data. The results show that the heuristic approach simultaneously reduces total costs and balances the number of trips assigned to each recycling facility.     

随机多模式资源受限项目调度

项目调度是实现项目资源优化配置的重要手段。项目执行时往往面临大量不确定因素,并呈现出典型的多模式特性,给项目调度带来了很大挑战。鉴于此,本文研究活动工期不确定条件下的多模式资源受限项目调度问题,建立了该问题的马尔科夫决策过程模型。为了高效求解上述模型,设计了基于Rollout的近似动态规划算法。该算法可以在项目执行过程中根据最新的项目状态动态给出调度方案,从而有效优化项目期望工期。在所提算法中,利用“活动—模式”列表与并行调度机制相结合的启发式算法构建基准策略,并设计了基于离散时间马尔科夫链的动态仿真,以进一步提升算法性能。基于公开的项目调度问题库PSPLIB,通过大规模计算实验分析了本文算法的性能,探讨了多种因素对调度效果的影响。     

Scheduling Methods for Efficient Stamping Operations at an Automotive Company

We consider scheduling issues at Beyçelik, a Turkish automotive stamping company that uses presses to give shape to metal sheets in order to produce auto parts. The problem concerns the minimization of the total completion time of job orders (i.e., makespan) during a planning horizon. This problem may be classified as a combined generalized flowshop and flexible flowshop problem with special characteristics. We show that the Stamping Scheduling Problem is NP‐Hard. We develop an integer programming‐based method to build realistic and usable schedules. Our results show that the proposed method is able to find higher quality schedules (i.e., shorter makespan values) than both the company's current process and a model from the literature. However, the proposed method has a relatively long run time, which is not practical for the company in situations when a (new) schedule is needed quickly (e.g., when there is a machine breakdown or a rush order). To improve the solution time, we develop a second method that is inspired by decomposition. We show that the second method provides higher‐quality solutions—and in most cases optimal solutions—in a shorter time. We compare the performance of all three methods with the company's schedules. The second method finds a solution in minutes compared to Beyçelik's current process, which takes 28 hours. Further, the makespan values of the second method are about 6.1% shorter than the company's schedules. We estimate that the company can save over €187,000 annually by using the second method. We believe that the models and methods developed in this study can be used in similar companies and industries.     

Scheduling Truck Arrivals at an Air Cargo Terminal

We consider the scheduling of truck arrivals at an air cargo terminal. By coordinating arrivals of cargo delivery trucks with outbound flight departure schedules, some of the shipments can be transferred directly to the departing flights, while others will be stored at the terminal's storage facility and incur extra handling and storage costs. The objective is to obtain a feasible schedule so as to minimize the total cost of operations. We formulate the problem as a time‐indexed integer program and show that, even with limited number of unloading docks at the terminal, the problem is non‐trivial (NP‐hard in the strong sense). Our solution method includes an exact solution procedure to determine an optimal unloading sequence for the shipments carried by each truck, together with a Lagrangian relaxation‐based heuristic for assigning trucks to truck docks and determining truck arrival times. We conducted computational experiments to test the performance of our solution method. Computational results show that our method can generate near‐optimal solutions efficiently. Our simulation results indicate that the scheduling approach proposed in this paper has the potential to generate significant cost savings over a first‐come, first‐served approach currently used at the air cargo terminal that we observed.     

一个单件车间生产作业计划优化模拟系统

针对中小批量单件车间生产作业计划生成与再生问题,集成Visual Foxpro5.0与Siman 3.51开发了一个系统原型,包括模拟模型生成器、时间参数推算器和禁忌搜索算法。用模拟模型生成器得到一个比较详细的中小批量单件车间生产作业计划方案,以此为初始可行解,再用时间参数推算器和禁忌搜索算法进行优化,得到一个优化了的车间生产作业计划方案。实验表明,本系统较好地解决了中小批量单件车间生产作业计划生成问题。