A branch-and-bound algorithm for minimizing the total completion time in two-machine flowshop problem subject to release dates

被引：1
|
作者：
Rakrouki, Mohamed Ali [1 ,3 ]
Ladhari, Talel [2 ,3 ]
机构：
[1] Econ & Gest Jendouba, Fac Sci Jurid, Jendouba, Tunisia
[2] Ecole Superieure Sci Econom & Commerciales, Tunis, Tunisia
[3] Unite recherche ROI, Ecole Polytechn Tunisie, La Marsa, Tunisia
来源：
CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3 | 2009年
关键词：
Branch-and-bound; flowshop; release dates; total flowtime; SHOP PROBLEM; SCHEDULING PROBLEMS;
D O I：
10.1109/ICCIE.2009.5223879
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we consider the problem of minimizing the sum of completion times in a two-machine permutation flowshop subject to release dates. We present several variants of a branch-and-bound algorithm for the problem under consideration. Computational experiments on a large set of randomly generated instances show that problems up to 30 (70, and 100) job problems when release dates are uniformly distributed in the [1, 100] and [1, 200] ([1, 100n], [1, 200n]) range can be solved in a reasonable CPU time.
引用
收藏
页码：80 / +
页数：3
相关论文
共 50 条
12345