Hierarchical minimization of completion time variance and makespan in jobshops

This paper addresses the problem of minimizing makespan for a given set of n jobs to be processed on each of m machines in a static jobshop, subject to the minimum completion time variance (CTV). A lower bound on CTV is developed for the static jobshop problem. A backward scheduling approach is proposed using the observations on the development of lower bound for hierarchical minimization of CTV and makespan. A lower bound on makespan subject to minimum CTV is also presented for this problem. Finally, we present two simulated annealing heuristic approaches using the concepts of forward and backward scheduling. Their performances are compared against each other through the use of the lower bounds established in this work. The simulated annealing heuristic based on backward scheduling is shown to perform well by evaluating the developed heuristics on 82 jobshop problems taken from literature.

[1]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[2]  John J. Kanet,et al.  Minimizing Variation of Flow Time in Single Machine Systems , 1981 .

[3]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[4]  Mitsuo Gen,et al.  Genetic Algorithms , 1999, Wiley Encyclopedia of Computer Science and Engineering.

[5]  Clifford Stein,et al.  On the existence of schedules that are near-optimal for both makespan and total weighted completion time , 1997, Oper. Res. Lett..

[6]  G. Srinivasan,et al.  A branch and bound algorithm to minimize completion time variance on a single processor , 2003, Comput. Oper. Res..

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

[8]  Jose A. Ventura,et al.  Minimizing single-machine completion time variance , 1995 .

[9]  Charalambos A. Marangos,et al.  Algorithms to minimize completion time variance in a two machine flowshop , 1998 .

[10]  Yash P. Gupta,et al.  Minimizing flow time variance in a single machine system using genetic algorithms , 1993 .

[11]  Prabuddha De,et al.  On the Minimization of Completion Time Variance with a Bicriteria Extension , 1992, Oper. Res..

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

[13]  C. R. Bector,et al.  Minimizing the Flow-time Variance in Single-machine Systems , 1990 .

[14]  Wieslaw Kubiak,et al.  Completion time variance minimization on a single machine is difficult , 1993, Oper. Res. Lett..

[15]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[16]  Chandrasekharan Rajendran,et al.  Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date , 2001, Eur. J. Oper. Res..

[17]  Egon Balas,et al.  The Shifting Bottleneck Procedure for Job Shop Scheduling , 1988 .

[18]  Richard W. Eglese,et al.  Simulated annealing: A tool for operational research , 1990 .

[19]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[20]  G. B. McMahon,et al.  Flow-Shop Scheduling with the Branch-and-Bound Method , 1967, Oper. Res..

[21]  Yeong-Dae Kim,et al.  A backward approach in list scheduling algorithms for multi-machine tardiness problems , 1995, Comput. Oper. Res..

[22]  Gur Mosheiov,et al.  Simultaneous minimization of total completion time and total deviation of job completion times , 2004, Eur. J. Oper. Res..

[23]  Gur Mosheiov,et al.  Heuristics for multimachine scheduling problems with earliness and tardiness costs , 1996 .

[24]  Z. A. Lomnicki,et al.  Some Applications of the “Branch-and-Bound” Algorithm to the Machine Scheduling Problem , 1966 .

[25]  Joseph A. Svestka,et al.  A bi-directional scheduling approach for job shops , 1999 .

[26]  V. Rajendra Prasad,et al.  Bounds for the position of the smallest job in completion time variance minimization , 1999, Eur. J. Oper. Res..

[27]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[28]  Gur Mosheiov,et al.  Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems , 1993 .

[29]  Uttarayan Bagchi,et al.  Simultaneous Minimization of Mean and Variation of Flow Time and Waiting Time in Single Machine Systems , 1989, Oper. Res..

[30]  Madabhushi Raghavachari,et al.  A hybrid simulated annealing approach for single machine scheduling problems with non-regular penalty functions , 1993, Comput. Oper. Res..

[31]  Takeshi Yamada,et al.  A Genetic Algorithm Applicable to Large-Scale Job-Shop Problems , 1992, PPSN.

[32]  Samuel Eilon,et al.  Minimising Waiting Time Variance in the Single Machine Problem , 1977 .

[33]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .

[34]  Yih-Long Chang,et al.  Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date , 1987 .

[35]  M. Raghavachari,et al.  Deterministic and Random Single Machine Sequencing with Variance Minimization , 1987, Oper. Res..

[36]  M. Pirlot.  General local search methods , 1996 .