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 条
  • [1] Flowshop scheduling problem with a batching machine and task compatibilities
    Oulamara, A.
    Finke, G.
    Kuiteing, A. Kamgaing
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (02) : 391 - 401
  • [2] Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
    Pei, Jun
    Liu, Xinbao
    Pardalos, Panos M.
    Fan, Wenjuan
    Yang, Shanlin
    [J]. OPTIMIZATION LETTERS, 2015, 9 (01) : 91 - 104
  • [3] Single machine serial-batching scheduling with independent setup time and deteriorating job processing times
    Jun Pei
    Xinbao Liu
    Panos M. Pardalos
    Wenjuan Fan
    Shanlin Yang
    [J]. Optimization Letters, 2015, 9 : 91 - 104
  • [4] An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
    Fu, Ruyan
    Tian, Ji
    Li, Shisheng
    Yuan, Jinjiang
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 34 (04) : 1187 - 1197
  • [5] Scheduling an unbounded batching machine with family jobs and setup times
    Zheng, R.
    Li, H.
    Zhang, X.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (02) : 160 - 167
  • [6] An optimal online algorithm for the parallel-batch scheduling with job processing time compatibilities
    Ruyan Fu
    Ji Tian
    Shisheng Li
    Jinjiang Yuan
    [J]. Journal of Combinatorial Optimization, 2017, 34 : 1187 - 1197
  • [7] Scheduling hybrid flowshop with parallel batching machines and compatibilities
    Bellanger, A.
    Oulamara, A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 1982 - 1992
  • [8] Approximation Schemes for Scheduling a Batching Machine with Nonidentical Job Size
    Xianzhao Zhang
    Yuzhong Zhang
    Zhigang Cao
    Zengxia Cai
    [J]. Journal of Systems Science and Complexity, 2007, 20 : 592 - 600
  • [9] Approximation schemes for scheduling a batching machine with nonidentical job size
    Zhang, Xianzhao
    Zhang, Yuzhong
    Cao, Zhigang
    Cai, Zengxia
    [J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2007, 20 (04) : 592 - 600
  • [10] Simultaneous optimization scheduling with two agents on an unbounded serial-batching machine
    He, Cheng
    Li, Shi-Sheng
    Wu, Jing
    [J]. RAIRO-OPERATIONS RESEARCH, 2021, 55 (06) : 3701 - 3714
12345