Anticipation and flexibility in dynamic scheduling

Many real-world optimization problems change over time and require frequent re-optimization. We suggest that in such environments, an optimization algorithm should reflect the problem's dynamics and explicitly take into account that changes to the current solution are to be expected. We claim that this can be achieved by having the optimization algorithm search for solutions that are not only good, but also flexible, i.e. easily adjustable if necessary in the case of problem changes. For the example of a job-shop with jobs arriving non-deterministically over time, we demonstrate that avoiding early idle times increases flexibility, and thus that the incorporation of an early idle time penalty as secondary objective into the scheduling algorithm can greatly enhance the overall system performance.

[1]  Pei-Chann Chang,et al.  A Rescheduling Procedure for Manufacturing Systems Under Random Disruptions , 1992 .

[2]  Peter Brucker,et al.  Sequencing and scheduling , 2003, Eur. J. Oper. Res..

[3]  Toni M. Somers,et al.  The measurement of manufacturing flexibility , 1992 .

[4]  Chandrasekharan Rajendran,et al.  A comparative study of dispatching rules in dynamic flowshops and jobshops , 1999, Eur. J. Oper. Res..

[5]  Kenneth R. Baker,et al.  AN EXPERIMENTAL STUDY OF THE EFFECTIVENESS OF ROLLING SCHEDULES IN PRODUCTION PLANNING , 1977 .

[6]  Nabil R. Adam,et al.  Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules , 1980 .

[7]  A. P. Muhlemann,et al.  The dynamic aspects of a production scheduling problem , 1979 .

[8]  Dirk C. Mattfeld,et al.  Scalable search spaces for scheduling problems , 1999 .

[9]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[10]  A. G. Lockett,et al.  Job shop scheduling heuristics and frequency of scheduling , 1982 .

[11]  Reha Uzsoy,et al.  Analysis of periodic and event-driven rescheduling policies in dynamic shops , 1992 .

[12]  Jürgen Branke,et al.  Anticipation in Dynamic Optimization: The Scheduling Case , 2000, PPSN.

[13]  Chris N. Potts,et al.  Rescheduling for New Orders , 2004, Oper. Res..

[14]  Marko Snoek,et al.  Anticipation Optimization in Dynamic Job Shops , 2001 .

[15]  G. Rand.  Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop , 1982 .

[16]  Rong-Kwei Li,et al.  A heuristic rescheduling algorithm for computer-based production scheduling systems , 1993 .

[17]  Sema E. Alptekin,et al.  Product flexibility in selecting manufacturing planning and control strategy , 2000 .

[18]  Yasuhiro Tsujimura,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms, part II: hybrid genetic search strategies , 1999 .

[19]  Giovanni Semeraro,et al.  An agent that learns to support users of a Web site , 2004 .

[20]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[21]  Warren B. Powell,et al.  On the Value of Optimal Myopic Solutions for Dynamic Routing and Scheduling Problems in the Presence of User Noncompliance , 2000, Transp. Sci..

[22]  Xin Yao,et al.  Evolutionary Optimization , 2002 .

[23]  Christian Bierwirth,et al.  On Permutation Representations for Scheduling Problems , 1996, PPSN.

[24]  Stanley B. Gershwin,et al.  An algorithm for the computer control of a flexible manufacturing system , 1983 .

[25]  Andreas Drexl,et al.  Scheduling of Project Networks by Job Assignment , 1991 .

[26]  Javier Pereira,et al.  Flexibility in manufacturing systems: A relational and a dynamic approach , 2001, Eur. J. Oper. Res..

[27]  P. Aravindan,et al.  Comparative evaluation of genetic algorithms for job-shop scheduling , 2001 .

[28]  T. S. Raghu,et al.  An efficient dynamic dispatching rule for scheduling in a job shop , 1993 .

[29]  Anil K. Jain,et al.  PRODUCTION SCHEDULING/RESCHEDULING IN FLEXIBLE MANUFACTURING , 1997 .

[30]  Robert H. Storer,et al.  Robustness Measures and Robust Scheduling for Job Shops , 1994 .

[31]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[32]  H. Pierreval,et al.  Dynamic scheduling selection of dispatching rules for manufacturing system , 1997 .

[33]  Chandrasekharan Rajendran,et al.  Efficient dispatching rules for scheduling in a job shop , 1997 .

[34]  Bernard W. Taylor,et al.  A comparative analysis of the COVERT job sequencing rule using various shop performance measures , 1987 .

[35]  M. Snoek,et al.  Anticipation Optimization in Dynamic Job Shop , 2001 .

[36]  Mikkel T. Jensen,et al.  Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures , 2001, Appl. Soft Comput..

[37]  Christian Bierwirth,et al.  Production Scheduling and Rescheduling with Genetic Algorithms , 1999, Evolutionary Computation.

[38]  G. T. Mackulak,et al.  Robust deterministic scheduling in stochastic environments: The method of capacity hedge points , 1997 .

[39]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[40]  Erhan Kutanoglu,et al.  Improving Schedule Robustness via Stochastic Analysis and Dynamic Adaptation , 1998 .

[41]  Yugeng Xi,et al.  A rolling horizon job shop rescheduling strategy in the dynamic environment , 1997 .

[42]  Yi-Chih Hsieh,et al.  An approach to the measurement of single-machine flexibility , 2001 .

[43]  Narayan Raman,et al.  The job shop tardiness problem: A decomposition approach , 1993 .

[44]  Reha Uzsoy,et al.  Predictable scheduling of a job shop subject to breakdowns , 1998, IEEE Trans. Robotics Autom..

[45]  Mark Pagell,et al.  Uncertainty, Flexibility and Buffers: Three Case Studies , 1998 .

[46]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[47]  R. Haupt,et al.  A survey of priority rule-based scheduling , 1989 .

[48]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[49]  Shimon Y. Nof,et al.  Scheduling/rescheduling in the manufacturing operating system environment† , 1985 .

[50]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[51]  Roger L. Wainwright,et al.  Multiple Vehicle Routing with Time and Capacity Constraints Using Genetic Algorithms , 1993, ICGA.

[52]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[53]  Upendra Dave,et al.  Heuristic Scheduling Systems , 1993 .

[54]  W. Punch,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems , 1997 .