BATCH SCHEDULING TO MINIMIZE TOTAL COMPLETION-TIME

被引：35

作者：

GHOSH, JB

机构：

[1] Department of MIS and Decision Sciences, University of Dayton, Dayton, OH 45429-0439

来源：

OPERATIONS RESEARCH LETTERS | 1994年 / 16卷 / 05期

关键词：

ANALYSIS OF ALGORITHMS; DYNAMIC PROGRAMMING; PRODUCTION SCHEDULING;

D O I：

10.1016/0167-6377(94)90040-X

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We address single and multiple machine versions of the batch scheduling problem which arises when there are job families and setup requirements between these families; our aim is to minimize the total of the completion or weighted completion times. The observations provided by us extend past results.

引用

收藏

页码：271 / 275

页数：5

相关论文

共 14 条

[1] SINGLE FACILITY MULTICLASS JOB SCHEDULING [J].

AHN, BH ;

HYUN, JH .

COMPUTERS & OPERATIONS RESEARCH, 1990, 17 (03) :265-272

[2] BATCHING TO MINIMIZE FLOW TIMES ON ONE MACHINE [J].

DOBSON, G ;

KARMARKAR, US ;

RUMMEL, JL .

MANAGEMENT SCIENCE, 1987, 33 (06) :784-799

[3] BATCHING TO MINIMIZE FLOW TIMES ON PARALLEL HETEROGENEOUS MACHINES [J].

DOBSON, G ;

KARMARKAR, US ;

RUMMEL, JL .

MANAGEMENT SCIENCE, 1989, 35 (05) :607-613

[4]

Garey MR., 1979, COMPUTERS INTRACTABI

[5] SINGLE FACILITY SCHEDULING WITH MULTIPLE JOB CLASSES [J].

GUPTA, JND .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1988, 33 (01) :42-45

[6] OPTIMAL SCHEDULES FOR SINGLE FACILITY WITH 2 JOB CLASSES [J].

GUPTA, JND .

COMPUTERS & OPERATIONS RESEARCH, 1984, 11 (04) :409-413

[7]

HAM I, 1985, GROUP TECHNOLOGY APP

[8] ON THE COMPLEXITY OF SCHEDULING WITH BATCH SETUP TIMES [J].

MONMA, CL ;

POTTS, CN .

OPERATIONS RESEARCH, 1989, 37 (05) :798-804

[9]

Nemhauser G. L., 1988, INTEGER COMBINATORIA

[10] INTEGRATING SCHEDULING WITH BATCHING AND LOT-SIZING - A REVIEW OF ALGORITHMS AND COMPLEXITY [J].

POTTS, CN ;

VANWASSENHOVE, LN .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1992, 43 (05) :395-406