Fixed interval scheduling under uncertainty - A tabu search algorithm for an extended robust coloring formulation

Fixed interval scheduling problem under uncertainty is formulated using stochastic programming.Risk is represented by random delays in processing times.Equivalent deterministic robust coloring formulations are proposed.Small simulated instances are solved to optimality by standard software tools.A tabu search algorithm suitable for larger instances is implemented. We propose several formulations of the fixed interval scheduling problem under uncertainty, where the risk is represented by random delays in processing times. We employ various stochastic programming and robust coloring problems to deal with the uncertainty. Our main goal is to introduce equivalent deterministic reformulations of the stochastic programming problems. We show that the minimization of the expected number of overlaps is equivalent to the deterministic robust coloring problem under particular choice of the penalties. Moreover, we extend the robust coloring problem to obtain equivalence with the stochastic programming problem with the schedule reliability objective under multivariate distribution of delays represented by an Archimedean copula. We show that small simulated instances of this problem can be solved to optimality by available software tools and we propose a tabu search algorithm suitable for larger instances.

[1]  Alexander Shapiro,et al.  Lectures on Stochastic Programming: Modeling and Theory , 2009 .

[2]  J Figueira,et al.  Stochastic Programming , 1998, J. Oper. Res. Soc..

[3]  Fan Wang,et al.  Metaheuristics for robust graph coloring , 2013, J. Heuristics.

[4]  Patrizia Beraldi,et al.  A heuristic approach for resource constrained project scheduling with uncertain activity durations , 2011, Comput. Oper. Res..

[5]  M. Sklar.  Fonctions de repartition a n dimensions et leurs marges , 1959 .

[6]  Walter J. Gutjahr,et al.  Project portfolio selection under uncertainty with outsourcing opportunities , 2013 .

[7]  Peter M. Verderame,et al.  Planning and Scheduling under Uncertainty: A Review Across Multiple Sectors , 2010 .

[8]  Leen Stougie,et al.  Approximation in two-stage stochastic integer programming , 2014 .

[9]  Bert De Reyck,et al.  Project Planning with Alternative Technologies in Uncertain Environments , 2013, Eur. J. Oper. Res..

[10]  Paolo Toth,et al.  A survey on vertex coloring problems , 2010, Int. Trans. Oper. Res..

[11]  Erhan Kozan,et al.  Techniques to effectively buffer schedules in the face of uncertainties , 2015, Comput. Ind. Eng..

[12]  Jan Karel Lenstra,et al.  Periodic Assignment and Graph Colouring , 1994, Discret. Appl. Math..

[13]  Errol L. Lloyd,et al.  Cost Constrained Fixed Job Scheduling , 2003, ICTCS.

[14]  Martin Branda,et al.  Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints , 2012, Oper. Res. Lett..

[15]  Rym M'Hallah,et al.  The planning and scheduling of operating rooms: A simulation approach , 2014, Comput. Ind. Eng..

[16]  T. C. Edwin Cheng,et al.  Fixed interval scheduling: Models, applications, computational complexity and algorithms , 2007, Eur. J. Oper. Res..

[17]  Jan Fabian Ehmke,et al.  Ensuring service levels in routing problems with time windows and stochastic travel times , 2015, Eur. J. Oper. Res..

[18]  Frits C. R. Spieksma,et al.  Interval scheduling: A survey , 2007 .

[19]  P. Embrechts,et al.  Quantitative Risk Management: Concepts, Techniques, and Tools , 2005 .

[20]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[21]  Bo Chen,et al.  Tactical fixed job scheduling with spread-time constraints , 2014, Comput. Oper. Res..

[22]  Thomas A. Henzinger,et al.  Probabilistic programming , 2014, FOSE.

[23]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[24]  Javier Yáñez,et al.  The robust coloring problem , 2003, Eur. J. Oper. Res..

[25]  David P. Morton,et al.  Prioritized interdiction of nuclear smuggling via tabu search , 2015, Optim. Lett..

[26]  S. H. Choi,et al.  Flexible flow shop scheduling with stochastic processing times: A decomposition-based approach , 2012, Comput. Ind. Eng..

[27]  Alain Hertz,et al.  A branch-and-price algorithm for the robust graph coloring problem , 2014, Discret. Appl. Math..

[28]  Fred Glover,et al.  Tabu Search: A Tutorial , 1990 .

[29]  Pieter Smet,et al.  The shift minimisation personnel task scheduling problem: a new hybrid approach and computational insights , 2014 .

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Enrico Angelelli,et al.  Optimal interval scheduling with a resource constraint , 2014, Comput. Oper. Res..

[32]  Leo G. Kroon,et al.  Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem , 1997, Oper. Res..

[33]  Maarten H. van der Vlerk.  Convex approximations for a class of mixed-integer recourse models , 2010, Ann. Oper. Res..

[34]  Leo Kroon,et al.  Exact and approximation algorithms for the operational fixed interval scheduling problem , 1995 .

[35]  Deniz Türsel Eliiyi.  Integrating tactical and operational decisions in fixed job scheduling , 2013 .

[36]  Johann Hurink,et al.  Reducing the number of required beds by rearranging the OR-schedule , 2014, OR Spectr..

[37]  Liji Shen.  A tabu search algorithm for the job shop problem with sequence dependent setup times , 2014, Comput. Ind. Eng..

[38]  Abdelaziz Dammak,et al.  A stochastic optimization and simulation approach for scheduling operating rooms and recovery beds in an orthopedic surgery department , 2015, Comput. Ind. Eng..