Minimizing the worst-case makespan for a job-shop scheduling system with uncertain processing times

This paper discusses a job-shop scheduling problem with uncertain processing times, which are described by discrete scenarios. A robust optimization model is established by minimizing the worst-case makespan for the job-shop scheduling system. Based on the characteristics of the established model, a neighborhood structure is constructed under the worst-case scenario, and a tabued simulated annealing hybrid algorithm with the constructed neighborhood is developed to solve the proposed problem. An extensive experiment was conducted to testify the effectiveness and the advantages of the developed algorithm by comparing with two possible alternative algorithms.

[1]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[2]  Vinícius Amaral Armentano,et al.  Robust optimization models for project scheduling with resource availability cost , 2007, J. Sched..

[3]  Michael Kolonko,et al.  Some new results on simulated annealing applied to the job shop scheduling problem , 1999, Eur. J. Oper. Res..

[4]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[5]  Rui Zhang,et al.  A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective , 2011, Comput. Oper. Res..

[6]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[7]  Panagiotis Kouvelis,et al.  Robust scheduling to hedge against processing time uncertainty in single-stage production , 1995 .

[8]  Saeed Zolfaghari,et al.  Adaptive temperature control for simulated annealing: a comparative study , 2004, Comput. Oper. Res..

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

[10]  Jan Karel Lenstra,et al.  Job Shop Scheduling by Simulated Annealing , 1992, Oper. Res..

[11]  Kuo-Ching Ying,et al.  Scheduling the two-machine flowshop to hedge against processing time uncertainty , 2015, J. Oper. Res. Soc..

[12]  Peigen Li,et al.  A very fast TS/SA algorithm for the job shop scheduling problem , 2008, Comput. Oper. Res..

[13]  I-Hsuan Hong,et al.  Scenario relaxation algorithm for finite scenario-based min-max regret and min-max relative regret robust optimization , 2008, Comput. Oper. Res..

[14]  Xi Yu-geng Robust scheduling in a Just-in-time single machine system with processing time uncertainty , 2007 .

[15]  Yang Xiao Bad-scenario Set Based Risk-resisting Robust Scheduling Model , 2012 .

[16]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[17]  Jan Van Damme,et al.  Project scheduling under uncertainty survey and research potentials , 2002 .

[18]  Peigen Li,et al.  A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem , 2007, Comput. Oper. Res..