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 条

[31] A NEW LOWER-BOUND FOR THE MAKESPAN OF A SINGLE-MACHINE SCHEDULING PROBLEM
TINHOFER, G
FARNBACHER, E
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1992, 180 : 209 - 218
[32] SINGLE-MACHINE SCHEDULING WITH DEADLINES TO MINIMIZE THE WEIGHTED NUMBER OF TARDY JOBS
HARIRI, AMA
POTTS, CN
MANAGEMENT SCIENCE, 1994, 40 (12) : 1712 - 1719
[33] SINGLE-MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND NUMBER OF JOBS TARDY
DANIELS, RL
SARIN, RK
OPERATIONS RESEARCH, 1989, 37 (06) : 981 - 984
[34] Parametric study on single machine early/tardy problem under fuzzy environment
Osman, Mohamed S.A.
Saad, Omar M.O.
Abass, Samir A.
Engineering Journal of University of Qatar, 2002, 15 : 177 - 192
[35] IMPROVED BOUNDS FOR THE RANGE OF LATENESS ON A SINGLE-MACHINE
TEGZE, M
VLACH, M
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (07) : 675 - 680
[36] Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time
Valente, Jorge M. S.
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (03) : 663 - 675
[37] Single-machine scheduling to minimize maximum tardiness with minimum number of tardy jobs
Gupta, JND
Hariri, AMA
Potts, CN
ANNALS OF OPERATIONS RESEARCH, 1999, 92 (0) : 107 - 123
[38] A SINGLE-MACHINE PROBLEM WITH MULTIPLE CRITERIA
KIRAN, AS
UNAL, AT
NAVAL RESEARCH LOGISTICS, 1991, 38 (05) : 721 - 727
[39] A HEURISTIC FOR THE SINGLE-MACHINE TARDINESS PROBLEM
PANWALKAR, SS
SMITH, ML
KOULAMAS, CP
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1993, 70 (03) : 304 - 310
[40] A note on single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine
Zhao, Qiulan
Yuan, Jinjiang
OPERATIONS RESEARCH LETTERS, 2019, 47 (06) : 607 - 610

← 1 2 3 4 5 →