Minimizing total flow time in a two-machine flowshop problem with minimum makespan

被引：42

作者：

Gupta, JND ^{[1
]}

Neppalli, VR ^{[1
]}

Werner, F ^{[1
]}

机构：

[1] Ball State Univ, Dept Management, Muncie, IN 47306 USA

来源：

INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS | 2001年 / 69卷 / 03期

关键词：

flowshop scheduling; hierarchical criteria; dominance conditions; heuristic algorithms; empirical evaluation;

D O I：

10.1016/S0925-5273(00)00039-6

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

This paper considers the two-machine flowshop scheduling problem where it is desired to find a minimum total flow time schedule subject to the condition that the makespan of the schedule is minimum. Based on the analysis of the problem characteristics, several existing results are extended to develop two optimization algorithms for the problem. In view of the NP-hardness of the problem, two polynomially solvable cases are identified and solved. Further, several polynomial heuristic solution algorithms are developed and empirically evaluated as to their effectiveness in finding an optimal schedule for the problem. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：323 / 338

页数：16

共 29 条

[1]

BAGGA PC, 1969, ADV FRONTIERS OPERAT, P145

[2]

CHEN CL, 1992, MULTICRITERIA FLOW S

[3]

CHEN CL, 1994, P 3 IE RES C ATL

[4]

DANIELS RL, 1990, NAV RES LOG, V37, P981, DOI 10.1002/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO

[5]

2-H

[6]

Gupta J. N. D., 1999, LOCAL SEARCH HEURIST

[7]

Gupta J. N. D., 1972, AIIE T, V4, P11, DOI DOI 10.1080/05695557208974823

[8]

Gupta JN., 1971, AIIE Transactions, V3, P199, DOI [10.1080/05695557108974807, DOI 10.1080/05695557108974807]

[9] Designing a tabu search algorithm for the two-stage flow shop problem with secondary criterion [J].

Gupta, JND ;

Palanimuthu, N ;

Chen, CL .

PRODUCTION PLANNING & CONTROL, 1999, 10 (03) :251-265

[10]

GUPTA JND, 1972, AIIE T, V4, P238

← 1 2 3 →