Minimizing total tardiness on a single machine with unequal release dates

被引:3
|
作者
Su, Ling-Huey [1 ]
Chen, Chung-Jung [1 ]
机构
[1] Chung Yuan Christian Univ, Dept Ind Engn, Chungli, Taiwan
关键词
single machine; total tardiness; unequal release dates; branch and bound algorithm; Heuristic algorithm;
D O I
10.1016/j.ejor.2006.07.051
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This study addresses the problem of minimizing total tardiness on a single machine with unequal release dates. Dominance properties established in previous literatures and herein are adopted to develop branch and bound and heuristic procedures. Computational experiments were conducted to evaluate the approaches. The results revealed that the branch and bound algorithm is efficient in solving hard problems and easy problems that involve up to 50 and 500 jobs, respectively. The computational effectiveness of the heuristic is also reported. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:496 / 503
页数:8
相关论文
共 50 条