Dominance rules for single machine schedule with sequence dependent setup and due date
Xiaochuan LUO
Xiao LIU
Chengen WANG
Zhen LIU
摘要：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.
机标关键词：due datesequence dependent setupmaximum tardinessbranch and boundsingle machinesetup times
分类号：TP3(计算技术、计算机技术)
资助基金：国家自然科学基金(79931000)
论文发表日期：2005-01-01
在线出版日期：2025-08-15（本平台首次上网日期，不代表文献的发表时间）
页数：7( 364-370 )
英文信息