A note on 'An efficient algorithm for the single-machine tardiness problem'

被引:6
作者
Biskup, D [1 ]
Piewitt, W [1 ]
机构
[1] Univ Bielefeld, Fac Econ & Business Adm, D-33501 Bielefeld, Germany
关键词
scheduling; single machine; tardiness; branch-and-bound;
D O I
10.1016/S0925-5273(00)00014-1
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The focus of this work is to give some comments on a paper recently published by Kondakci et al. (International Journal of Production Economics 36 (1994) 213-219). They present a new branch-and-bound algorithm for the famous total tardiness problem. However, some aspects of the algorithm remain vague, namely the application of the labelling scheme of Schrage and Baker (Operations Research 26 (1978) 444-449), the calculation of the lower bounds and the utilisation of Elmaghraby's (Journal of Industrial Engineering 19 (1968) 105-108) dominance theorem. As limiting total enumeration is the most interesting part of a branch-and-bound algorithm we clarify the inaccuracies and propose a fast recursion to calculate the lower bounds. We demonstrate the branch-and-bound algorithm by using an example. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:287 / 292
页数:6
相关论文
共 9 条
[1]  
Baker K.R., 1998, ELEMENTS SEQUENCING
[2]   MINIMIZING TOTAL TARDINESS ON ONE MACHINE IS NP-HARD [J].
DU, JZ ;
LEUNG, JYT .
MATHEMATICS OF OPERATIONS RESEARCH, 1990, 15 (03) :483-495
[3]  
ELMAGHRABY SE, 1968, J IND ENGINEERING, V19, P105
[4]   ONE-MACHINE SEQUENCING TO MINIMIZE CERTAIN FUNCTIONS OF JOB TARDINESS [J].
EMMONS, H .
OPERATIONS RESEARCH, 1969, 17 (04) :701-&
[5]   SCHEDULING PROBLEMS WITH GENERALIZED DUE DATES [J].
HALL, NG .
IIE TRANSACTIONS, 1986, 18 (02) :220-222
[6]   AN EFFICIENT ALGORITHM FOR THE SINGLE-MACHINE TARDINESS PROBLEM [J].
KONDAKCI, S ;
KIRCA, O ;
AZIZOGLU, M .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1994, 36 (02) :213-219
[7]   DYNAMIC-PROGRAMMING SOLUTION OF SEQUENCING PROBLEMS WITH PRECEDENCE CONSTRAINTS [J].
SCHRAGE, L ;
BAKER, KR .
OPERATIONS RESEARCH, 1978, 26 (03) :444-449
[8]  
Smith W., 1956, Naval Res. Logistics Q., V3, P59, DOI [DOI 10.1002/NAV.3800030106, 10.1002/nav.3800030106]
[9]   HYBRID ALGORITHM FOR ONE MACHINE SEQUENCING PROBLEM TO MINIMIZE TOTAL TARDINESS [J].
SRINIVASAN, V .
NAVAL RESEARCH LOGISTICS QUARTERLY, 1971, 18 (03) :317-+