Computational results for the flowshop tardiness problem

被引：10

作者：

Baker, Kenneth R. ^{[1
]}

机构：

[1] Dartmouth Coll, Tuck Sch Business, Hanover, NH 03755 USA

来源：

COMPUTERS & INDUSTRIAL ENGINEERING | 2013年 / 64卷 / 03期

关键词：

Scheduling; Sequencing; Flowshop; Tardiness; Integer programming; Spreadsheet models; MINIMIZING TOTAL TARDINESS; BOUND ALGORITHM; BRANCH;

D O I：

10.1016/j.cie.2012.12.018

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper reports on computational experiments involving optimal solutions to the flowshop tardiness problem. Of primary interest was a generic approach: solutions were obtained using a spreadsheet-based, mixed-integer programming code. However, the results compare favorably with those from a specially-tailored branch and bound algorithm. The main implication is that hardware and software have developed to the point that generic tools may offer the best way to solve combinatorial problems in scheduling. (C) 2013 Elsevier Ltd. All rights reserved.

引用

页码：812 / 816

页数：5

共 9 条

[1] EXPERIMENTAL COMPARISON OF SOLUTION ALGORITHMS FOR SINGLE-MACHINE TARDINESS PROBLEM [J].

BAKER, KR ;

MARTIN, JB .

NAVAL RESEARCH LOGISTICS, 1974, 21 (01) :187-199

[2] A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems [J].

Chung, Chia-Shin ;

Flynn, James ;

Kirca, Omer .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 174 (01) :1-10

[3] Different behaviour of a double branch-and-bound algorithm on Fm|prmu|Cmax,, and Fm|block|Cmax problems [J].

Companys, Ramon ;

Mateo, Manel .

COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (04) :938-953

[4] MINIMIZING TOTAL TARDINESS IN PERMUTATION FLOWSHOPS [J].

KIM, YD .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 85 (03) :541-555

[5] THE TOTAL TARDINESS PROBLEM - REVIEW AND EXTENSIONS [J].

KOULAMAS, C .

OPERATIONS RESEARCH, 1994, 42 (06) :1025-1041

[6] A BRANCH AND BOUND ALGORITHM FOR THE TOTAL WEIGHTED TARDINESS PROBLEM [J].

POTTS, CN ;

VANWASSENHOVE, LN .

OPERATIONS RESEARCH, 1985, 33 (02) :363-377

[7] Comparative evaluation of MILP flowshop models [J].

Stafford, EF ;

Tseng, FT ;

Gupta, JND .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2005, 56 (01) :88-101

[8] Algorithmic paradoxes of the single-machine total tardiness problem [J].

Szwarc, W ;

Grosso, A ;

Della Croce, F .

JOURNAL OF SCHEDULING, 2001, 4 (02) :93-104

[9] Minimising total tardiness in the m-machine flowshop problem: A review and evaluation of heuristics and metaheuristics [J].

Vallada, Eva ;

Ruiz, Ruben ;

Minella, Gerardo .

COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (04) :1350-1373

← 1 →