摘要: |
|
关键词: |
DOI: |
Received:November 16, 2004Revised:June 07, 2005 |
基金项目: |
|
Dominance rules for single machine schedule with sequence dependent setup and due date |
Xiaochuan LUO, Xiao LIU, Chengen WANG, Zhen LIU |
(Key Laboratory of Process Industry Automation,Ministry of Education,Shenyang Liaoning 110004,China;LOSI,Universite de Technologie de Troyes,Troyes Cedex 10010,France;School of Business Administration,Northeast University,Shenyang Liaoning 110004,China) |
Abstract: |
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. |
Key words: Dominance rule Sequence dependent setup Due date Single machine schedule Branch and bound |