论文信息 - Dominance rules for single machine schedule with sequence dependent setup and due date

Dominance rules for single machine schedule with sequence dependent setup and due date

Some dominance rules are proposed for the problems of scheduling N jobs on a single machine with due dates, sequence dependent setup times and no preemption. Two algorithms based on Ragatz s branch and bound scheme are developed including the dominance rules where the objective is to minimize the maximum tardiness or the total tardiness. Computational experiments demonstrate the effectiveness of the dominance rules.

Xiao Liu | Zhen Liu | Xiaochuan Luo | Chengen Wang

[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] 茨木俊秀,et al. Enumerative approaches to combinatorial optimization , 1987 .

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

[4] Fred W. Glover,et al. Construction heuristics for the asymmetric TSP , 2001, Eur. J. Oper. Res..

[5] Young Hoon Lee,et al. Scheduling jobs on parallel machines applying neural network and heuristic rules , 2000 .

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

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

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

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

[10] T. Ibaraki. Enumerative approaches to combinatorial optimization - part I , 1988 .

[11] Sushil K. Gupta. n jobs and m machines job-shop problems with sequence-dependent set-up times , 1982 .

[12] Lee J. Krajewski,et al. Kanban, MRP, and Shaping the Manufacturing Environment , 1987 .