A new branch-and-bound algorithm for the two-machine flowshop total tardiness problem

摘要：

We consider the classical two-machine flow shop scheduling problem, with total tardiness criterion. This problem is strongly NP-hard and literature contains already some exact branch-and-bound algorithms, lower bounds and dominance conditions for solving this problem. New dominance conditions and a new lower bound are proposed in this paper and are implemented in a branch-and-bound algorithm. Computational experiments show that the new branch-and-bound algorithm outperforms existing ones.

关键词： scheduling branch-and-bound flowshop total tardiness

作者: Jean-Charles BILLAUT Tong ZHANG

作者单位: Laboratoire dInformatique,Universite Fran.cois-Rabelais de Tours,37200 Tours,France

会议类型: 国际会议

会议名称: 工业工程与系统管理2007年国际会议(International Conference on Industrial Engineering and Systems Management)(IESM 2007)

会议地点: 北京

会议语种:英文

在线出版日期: 2007-05-30（万方平台首次上网日期，不代表论文的发表时间）