Minimizing the weighted number of tardy jobs on a two-machine flow shop

被引：34

作者：

Bulfin, RL

M'Hallah, R

机构：

[1] Auburn Univ, Dept Ind & Syst Engn, Auburn, AL 36849 USA

[2] Inst Super Gest Sousse, Dept Quantitat Methods, Sousse 4000, Tunisia

来源：

COMPUTERS & OPERATIONS RESEARCH | 2003年 / 30卷 / 12期

关键词：

scheduling; combinatorial optimization; branch-and-bound; surrogate relaxation;

D O I：

10.1016/S0305-0548(02)00114-4

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

In this paper, we describe an exact algorithm to solve the weighted number of tardy jobs two-machine flow shop scheduling problem. The algorithm uses branch-and-bound; a surrogate relaxation resulting in a multiple-choice knapsack provides the bounds. Extensive computational experiments indicate problems with 100 jobs can be solved quickly.

引用

页码：1887 / 1900

页数：14

共 16 条

[1]

[Anonymous], 1988, DISCRETE OPTIMIZATIO

[2] Minimizing tardy jobs in a flowshop with common due date [J].