Dynamic Template Scheduling to Address Uncertainty in Complex Scheduling Problems: a Case Study on Chemotherapy Outpatient Scheduling
نویسندگان
چکیده
Many scheduling problems contain uncertainty. In this paper, we address the uncertainty that arises from requests for appointments that arrive in real time. Requests must be assigned an appointment time immediately (i.e. before all requests are known) for service in the future. We propose dynamic template scheduling, a technique that combines proactive and online optimization and we apply it to the chemotherapy outpatient scheduling problem. We create a proactive template of an expected day in the chemotherapy center using a deterministic optimization model and an empirical distribution made from historical appointment data. As requests for appointments arrive, we use the proactive template to schedule them. When a request arrives that does not fit the template, we update the template online using the deterministic optimization model and the expected future appointments. We test the use of dynamic template scheduling against using a proactive template on its own, the optimal offline solution, and the actual performance of the cancer center. We find improvements in makespan of up to twenty percent when using dynamic template scheduling compared to current practice.
منابع مشابه
Dynamic optimization of chemotherapy outpatient scheduling with uncertainty.
Chemotherapy outpatient scheduling is a complex, dynamic, uncertain problem. Chemotherapy centres are facing increasing demands and they need to increase their efficiency; however there are very few studies looking at using optimization technology on the chemotherapy scheduling problem. We address dynamic uncertainty that arises from requests for appointments that arrive in real time and uncert...
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملA multi-product vehicle routing scheduling model with time window constraints for cross docking system under uncertainty: A fuzzy possibilistic-stochastic programming
Mathematical modeling of supply chain operations has proven to be one of the most complex tasks in the field of operations management and operations research. Despite the abundance of several modeling proposals in the literature; for vast majority of them, no effective universal application is conceived. This issue renders the proposed mathematical models inapplicable due largely to the fact th...
متن کامل