|
|||||
|
|
| Dominance rules for single machine schedule with sequence dependent setup and due date | |
| 作者姓名： | Xiaochuan LUO Xiao LIU Chengen WANG Zhen LIU |
| 作者单位： | [1]Key Laboratory of Process Industry Automation, Ministry of Education, Shenyang Liaoning 110004, China [2]LOSI, Universite de Technologie de Troyes, Troyes Cedex 10010, France [3]School of Business Administration, Northeast University, Shenyang Liaoning 110004, China |
| 基金项目： | This work was supported by EGIDE Foundation of France; National Natural Science Foundation of China （No. 79931000）. |
| 摘 要： | 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. |
| 关 键 词： | 网络控制 时序安排 分歧系统 时间序列 |
| 收稿时间： | 2004-11-16 |
| 修稿时间： | 2005-06-07 |
Dominance rules for single machine schedule with sequence dependent setup and due date |
|
| Xiaochuan LUO,Xiao LIU,Chengen WANG,Zhen LIU.Dominance rules for single machine schedule with sequence dependent setup and due date[J].Journal of Control Theory and Applications,2005,3(4):364-370. | |
| Authors: | Xiaochuan LUO Xiao LIU Chengen WANG Zhen LIU |
| Affiliation: | 1. Key Laboratory of Process Industry Automation, Ministry of Education, Shenyang Liaoning 110004, China;LOSI, Universite de Technologie de Troyes, Troyes Cedex 10010, France 2. School of Business Administration,Northeast University, Shenyang Liaoning 110004, China 3. Key Laboratory of Process Industry Automation, Ministry of Education, 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. |
| Keywords: | Dominance role Sequence dependent setup Due date Single machine schedule Branch and bound |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ | |
| 点击此处可从《控制理论与应用(英文版)》浏览原始摘要信息 | |
| 点击此处可从《控制理论与应用(英文版)》下载全文 | |