SOLUTION PROCEDURES FOR THE LOT-STREAMING PROBLEM

被引：54

作者：

BAKER, KR

PYKE, DF

机构：

[1] The Amos Tuck School of Business Administration, Dartmouth College, Hanover, New Hampshire

来源：

DECISION SCIENCES | 1990年 / 21卷 / 03期

关键词：

Planning and Control; Scheduling;

D O I：

10.1111/j.1540-5915.1990.tb00328.x

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Lot streaming is the process of splitting a job into sublots so its operations can be overlapped and its progress accelerated. We present a computationally efficient procedure for solving the m‐machine, two‐sublot problem, and we discuss the bottleneck insights that emerge from the analysis. We also examine heuristic approaches for more than two sublots and discuss computational results for these procedures. Copyright © 1990, Wiley Blackwell. All rights reserved

引用

页码：475 / 491

页数：17

共 9 条

[1]

BAKER KR, 1987, 203 DARTM COLL A TUC

[2]

CAMPBELL HG, 1970, MANAGE SCI B-APPL, V16, pB630

[3]

FOX RE, 1983, INVENTORIES PRODUCTI, V3

[4] REPETITIVE LOTS - FLOW-TIME REDUCTIONS THROUGH SEQUENCING AND DYNAMIC BATCH SIZING [J].

JACOBS, FR ;

BRAGG, DJ .

DECISION SCIENCES, 1988, 19 (02) :281-294

[5]

Johnson SM, 1954, NAV RES LOGIST Q, V1, P61, DOI DOI 10.1002/NAV.3800010110

[6]

KULONDA DJ, 27TH APICS ANN INT C, P78

[7]

POTTS CN, 1989, IN PRESS OPERATIONS

[8]

Suresh N.C., 1985, J OPER MANAG, V5, P151

[9]

TRIETSCH D, 1987, ORSA TIMS C

← 1 →