LOT-SIZING IN A NO-WAIT FLOW-SHOP

被引：14

作者：

EMMONS, H ^{[1
]}

MATHUR, K ^{[1
]}

机构：

[1] CASE WESTERN RESERVE UNIV,DEPT OPERAT RES,CLEVELAND,OH 44106

来源：

OPERATIONS RESEARCH LETTERS | 1995年 / 17卷 / 04期

关键词：

PRODUCTION SCHEDULING; SEQUENCING; TRAVELING SALESMAN;

D O I：

10.1016/0167-6377(95)00008-8

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We consider a no-wait flow shop which manufactures large numbers of copies of a few basic job types. After observing that a no-wait flow shop can be modeled as a traveling salesman problem (TSP), we present some results which can be used to reduce the size of the problem. Further results frequently allow us to quickly generate an optimal sequence for a set of jobs, based on the known solution to a subset or superset of these jobs.

引用

页码：159 / 164

页数：6

共 8 条

[1] SEQUENCING 1 STATE-VARIABLE MACHINE - SOLVABLE CASE OF TRAVELING SALESMAN PROBLEM [J].

GILMORE, PC ;

GOMORY, RE .

OPERATIONS RESEARCH, 1964, 12 (05) :655-&

[2]

Lenstra J K, 1977, ANN OPER RES, V1, P343, DOI [DOI 10.1016/S0167-5060(08)70743-X, 10.1016/S0167-5060(08)70743-X]

[3] COUNTEREXAMPLES TO OPTIMAL PERMUTATION SCHEDULES FOR CERTAIN FLOW-SHOP PROBLEMS [J].

PANWALKAR, SS ;

SMITH, ML ;

WOOLLAM, CR .

NAVAL RESEARCH LOGISTICS, 1981, 28 (02) :339-340

[4]

Piehler J., 1960, UNTERNEHMENSFORSCHUN, V4, P138

[5] THE 3-MACHINE NO-WAIT FLOWSHOP IS NP-COMPLETE [J].

ROCK, H .

JOURNAL OF THE ACM, 1984, 31 (02) :336-345

[6] TRAVELING SALESMAN PROBLEM - ON REDUCTION OF CERTAIN LARGE PROBLEMS TO SMALLER ONES [J].

ROTHKOPF, M .

OPERATIONS RESEARCH, 1966, 14 (03) :532-&

[7]

Sahni S., 1979, Mathematics of Operations Research, V4, P448, DOI 10.1287/moor.4.4.448

[8] SOLUTION OF FLOWSHOP-SCHEDULING PROBLEM WITH NO INTERMEDIATE QUEUES [J].

WISMER, DA .

OPERATIONS RESEARCH, 1972, 20 (03) :689-&

← 1 →