A bicriteria scheduling with sequence-dependent setup times

In this paper a bicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time and total tardiness. An integer programming model is developed for the problem which belongs to NP-hard class. Results of computational tests show that the proposed model is effective in solving problems with up to 12 jobs. For solving problems containing large number of jobs a special heuristic algorithm is proposed. Besides the proposed heuristic algorithm tabu search based heuristic is also used for large jobs problems. To improve the performance of tabu search method the result of the proposed heuristic algorithm is taken as an initial solution of tabu search method. According to computational results both heuristic algorithms are effective in finding problem solutions with up to 1000 jobs. According to the best of our knowledge, no works exists on the minimization of the weighted sum of total completion time and total tardiness with sequence-dependent setup times.

[1]  Paul A. Rubin,et al.  A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times , 2000 .

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

[3]  M. Asano,et al.  Single machine scheduling using dominance relation to minimize earliness subject to ready and due times , 1996 .

[4]  Pablo Moscato,et al.  A memetic algorithm for the total tardiness single machine scheduling problem , 2001, Eur. J. Oper. Res..

[5]  T. B. Tate,et al.  Machine Scheduling Problems , 1978 .

[6]  Shigeji Miyazaki,et al.  Backward Scheduling to Minimize the Actual Mean Flow Time with Dependent and Independent Setup Times , 1995 .

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

[8]  Arben Asllani,et al.  Job scheduling with dual criteria and sequence-dependent setups: mathematical versus genetic programming , 2004 .

[9]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[10]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[11]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[12]  Chandrasekharan Rajendran,et al.  Scheduling to minimize the sum of weighted flowtime and weighted tardiness of jobs in a flowshop with sequence-dependent setup times , 2003, Eur. J. Oper. Res..

[13]  Ram Rachamadugu,et al.  Real-time scheduling of an automated manufacturing center * , 1989 .

[14]  Reha Uzsoy,et al.  Production scheduling algorithms for a semiconductor test facility , 1991 .

[15]  Lucio Bianco,et al.  The traveling salesman problem with cumulative costs , 1993, Networks.

[16]  Andrew Kusiak,et al.  Scheduling manufacturing systems , 1992 .

[17]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[18]  Michael Pinedo,et al.  A heuristic to minimize the total weighted tardiness with sequence-dependent setups , 1997 .

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

[20]  Wen-Hwa Yang,et al.  Survey of scheduling research involving setup times , 1999, Int. J. Syst. Sci..

[21]  G. Rinaldi,et al.  Scheduling tasks with sequence-dependent processing times , 1988 .

[22]  Matteo Fischetti,et al.  The Delivery Man Problem and Cumulative Matroids , 1993, Oper. Res..

[23]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[24]  Paul A. Rubin,et al.  Scheduling in a sequence dependent setup environment with genetic search , 1995, Comput. Oper. Res..

[25]  F. J. Arcelus,et al.  On n/1/F setup dependent problems , 1983 .