Scheduling an unbounded batching machine with job processing time compatibilities

被引：8

作者：

Bellanger, A. ^{[1
]}

Janiak, A. ^{[2
]}

Kovalyov, M. Y. ^{[3
]}

Oulamara, A. ^{[1
]}

机构：

[1] Nancy Univ, LORIA Lab, Ecole Mines Nancy, F-54042 Nancy, France

[2] Wroclaw Univ Technol, Inst Engn Cybernet, PL-50372 Wroclaw, Poland

[3] Natl Acad Sci Belarus, United Inst Informat Problems, Minsk 220012, BELARUS

来源：

DISCRETE APPLIED MATHEMATICS | 2012年 / 160卷 / 1-2期

关键词：

Batching machine; Compatibility; Complexity; Dynamic programming; COMPLETION-TIME; ALGORITHMS; FLOWSHOP;

D O I：

10.1016/j.dam.2011.09.004

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

The problem of scheduling n jobs on an unbounded batching machine to minimize a regular objective function is studied. In this problem intervals for job processing times are given. The machine can process any number of jobs in a batch, provided that the processing time intervals of these jobs have a non-empty intersection. The jobs in the same batch start and complete together, and the batch processing time is equal to the left endpoint of the intersection of the processing time intervals in this batch. Properties of an optimal schedule are established and an enumerative algorithm based on these properties is developed. For the total completion time minimization, a dynamic programming algorithm is developed. Minimizing the makespan is shown to be solvable in O(n log n) time and minimizing the maximum lateness is proved to be NP-hard. (C) 2011 Elsevier B.V. All rights reserved.

引用

页码：15 / 23

页数：9

共 50 条

[31] Parallel machine batching and scheduling with deadlines
Cheng, T.C. Edwin
Kovalyov, Mikhail Y.
[J]. Journal of Scheduling, 2000, 3 (02) : 109 - 123
[32] An on-line algorithm for the single machine unbounded parallel-batching scheduling with large delivery times
Tian, Ji
Fu, Ruyan
Yuan, Jinjiang
[J]. INFORMATION PROCESSING LETTERS, 2011, 111 (21-22) : 1048 - 1053
[33] HIERARCHICAL OPTIMIZATION ON AN UNBOUNDED PARALLEL-BATCHING MACHINE
He, Cheng
Li, Li
[J]. RAIRO-OPERATIONS RESEARCH, 2018, 52 (01) : 55 - 60
[34] Unbounded parallel-batching scheduling with two competitive agents
Li, Shisheng
Yuan, Jinjiang
[J]. JOURNAL OF SCHEDULING, 2012, 15 (05) : 629 - 640
[35] Scheduling a batch processing machine with incompatible job families
Azizoglu, M
Webster, S
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2001, 39 (3-4) : 325 - 335
[36] Unbounded parallel-batching scheduling with two competitive agents
Shisheng Li
Jinjiang Yuan
[J]. Journal of Scheduling, 2012, 15 : 629 - 640
[37] Single machine batch scheduling with sequential job processing
Cheng, TCE
Kovalyov, MY
[J]. IIE TRANSACTIONS, 2001, 33 (05) : 413 - 420
[38] A Batching Machine Model for Lot Scheduling on a Single Machine
Kovalyov, Mikhail Y.
[J]. FOUNDATIONS OF COMPUTING AND DECISION SCIENCES, 2018, 43 (01) : 37 - 40
[39] SCHEDULING OF A 2-MACHINE FLOWSHOP WITH PROCESSING TIME LINEARLY DEPENDENT ON JOB WAITING-TIME
SRISKANDARAJAH, C
GOYAL, SK
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1989, 40 (10) : 907 - 921
[40] The Competing Job Sets Scheduling Problems With Two Types of Release Dates on Batching-Machine
Zhao X.-L.
Gong H.
Che P.
[J]. Zhao, Xiao-Li (zhaoxiaoli824@163.com), 1600, Science Press (46): : 168 - 177

← 1 2 3 4 5 →