A Simulated Annealing Approach to Bicriteria Scheduling Problems on a Single Machine

In this paper, we apply a simulated annealing approach to two bicriteria scheduling problems on a single machine. The first problem is the strongly NP-hard problem of minimizing total flowtime and maximum earliness. The second one is the NP-hard problem of minimizing total flowtime and number of tardy jobs. We experiment on different neighbourhood structures as well as other parameters of the simulated annealing approach to improve its performance. Our computational experiments show that the developed approach yields solutions that are very close to lower bounds and hence very close to the optimal solutions of their corresponding problems for the minimization of total flowtime and maximum earliness. For the minimization of total flowtime and number tardy, our experiments show that the simulated annealing approach yields results that are superior to randomly generated schedules.

[1]  Suna Kondakci,et al.  Scheduling with bicriteria: total flowtime and number of tardy jobs , 1997 .

[2]  R. S. Laundy,et al.  Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .

[3]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[4]  Horace W. Heck,et al.  A note on the extension of a result on scheduling with secondary criteria , 1972 .

[5]  Alistair I. Mees,et al.  Convergence of an annealing algorithm , 1986, Math. Program..

[6]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[7]  Ali Tamer Unal,et al.  A single‐machine problem with multiple criteria , 1991 .

[8]  Chengbin Chu.  A branch‐and‐bound algorithm to minimize total flow time with unequal release dates , 1992 .

[9]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[10]  K. Lin.  Hybrid algorithm for sequencing with bicriteria , 1983 .

[11]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[12]  M. Azizoglu,et al.  Minimizing flowtime and maximum earliness on a single machine , 1998 .

[13]  Jitender S. Deogun,et al.  Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time , 1981, SIAM J. Comput..

[14]  Rakesh K. Sarin,et al.  Scheduling with multiple performance measures: the one-machine case , 1986 .

[15]  Sen Tapan,et al.  A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem , 1983 .

[16]  Keah Choon Tan,et al.  Minimizing Tardiness on a Single Processor with Sequence Dependent Setup Times: A Simulated Annealing Approach , 1997 .

[17]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[18]  D. Janaki Ram,et al.  Distributed simulated annealing algorithms for job shop scheduling , 1995, IEEE Trans. Syst. Man Cybern..

[19]  Mohamed Ben-Daya,et al.  A simulated annealing approach for the one-machine mean tardiness scheduling problem , 1996 .

[20]  David Connolly.  An improved annealing scheme for the QAP , 1990 .

[21]  Lucio Bianco,et al.  Scheduling of a single machine to minimize total weighted completion time subject to release dates , 1982 .

[22]  R. Bulfin,et al.  Complexity of single machine, multi-criteria scheduling problems , 1993 .

[23]  Christos Koulamas.  Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem , 1997 .

[24]  Ludo Gelders,et al.  Solving a bicriterion scheduling problem , 1980 .

[25]  Jitender S. Deogun.  On Scheduling with Ready Times to Minimize Mean Flow Time , 1983, Comput. J..

[26]  C. N. Potts,et al.  Scheduling with release dates on a single machine to minimize total weighted completion time , 1992, Discret. Appl. Math..