A comparison of lower bounds for the single-machine early/tardy problem

被引：17
|
作者：
Schaller, Jeffrey [1 ]
机构：
[1] Eastern Connecticut State Univ, Dept Business Adm, Willimantic, CT 06226 USA
来源：
COMPUTERS & OPERATIONS RESEARCH | 2007年 / 34卷 / 08期
关键词：
scheduling; sequencing; branch-and-bound; heuristics;
D O I：
10.1016/j.cor.2005.09.003
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper considers the single-machine early/tardy problem. The paper presents a procedure that integrates a timetabling algorithm into a lower bound for jobs not included in a partial sequence. The paper also shows how two lower bounds that were developed previously for the problem can be improved. The lower bounds are tested on problems of various sizes and parameters for the distribution of due dates. The results show that the lower bounds are able to increase the efficiency of a branch-and-bound algorithm. (c) 2005 Elsevier Ltd. All rights reserved.
引用
收藏
页码：2279 / 2292
页数：14
相关论文
共 50 条
12345