FLOW-SHOPS WITH A DOMINANT MACHINE

被引：17

作者：

VANDENNOUWELAND, A

KRABBENBORG, M

POTTERS, J

机构：

[1] Department of Mathematics, NICI, University of Nijmegen, 6525 ED Nijmegen, Toernooiveld

来源：

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1992年 / 62卷 / 01期

关键词：

FLOWSHOP; DOMINANT MACHINE; PERMUTATION SCHEDULE; REGULAR CRITERIA;

D O I：

10.1016/0377-2217(92)90175-9

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Flow-shop problems with a dominant machine are introduced. We show that for this kind of problems we can restrict our search for an optimal schedule to permutation schedules if the optimality criterion is regular. Furthermore, we give an expression for the completion times with respect to a semi-active permutation schedule and we give fast algorithms for the weighted completion times and the maximal lateness criterion.

引用

页码：38 / 46

页数：9

共 12 条

[1]

Baker K., 1974, INTRO SEQUENCING SCH

[2] SEQUENCING GAMES [J].

CURIEL, I ;

PEDERZOLI, G ;

TIJS, S .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1989, 40 (03) :344-351

[3] DEVELOPMENT OF M-STAGE DECISION RULE FOR SCHEDULING N JOBS THROUGH M MACHINES [J].

DUDEK, RA ;

TEUTON, OF .

OPERATIONS RESEARCH, 1964, 12 (03) :471-&

[4]

French S., 1982, SEQUENCING SCHEDULIN

[5]

Garey MR., 1979, COMPUTERS INTRACTABI

[6]

GUPTA J, 1971, OPER RES, P1753

[7]

KAN AR, 1973, BW2773 MATH CENTR RE

[8]

KRABBENBORG M, 1989, THESIS U NIJMEGEN

[9]

Lenstra J. K., 1977, MATH CTR TRACTS, V69

[10] FLOWSHOP SEQUENCING PROBLEM WITH ORDERED PROCESSING TIME MATRICES [J].

SMITH, ML ;

PANWALKAR, SS ;

DUDEK, RA .

MANAGEMENT SCIENCE SERIES A-THEORY, 1975, 21 (05) :544-549

← 1 2 →