Minimizing makespan with release times on identical parallel batching machines

被引：29
|
作者：
Li, SG [1 ]
Li, GJ
Zhang, SQ
机构：
[1] Yantai Univ, Dept Math & Informat Sci, Yantai 264005, Peoples R China
[2] Chinese Acad Sci, Inst Software, Beijing 100080, Peoples R China
[3] Shandong Univ, Sch Math & Syst Sci, Jinan 250100, Peoples R China
[4] Tianjin Normal Univ, Sch Comp & Informat Engn, Tianjin 300074, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2005年 / 148卷 / 01期
关键词：
polynomial time approximation scheme; identical parallel hatching machines; scheduling; makespan;
D O I：
10.1016/j.dam.2004.11.004
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider the problem of scheduling n jobs on m identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). We present a polynomial time approximation scheme (PTAS) for this problem. (c) 2004 Elsevier B.V. All rights reserved.
引用
收藏
页码：127 / 134
页数：8
相关论文
共 50 条
  • [1] Minimizing Makespan on Identical Parallel Machines
    Habiba, Houari
    Hassam, Ahmed
    Sari, Zaki
    Amine, Cherier Mohamed
    Souad, Tahraoui
    [J]. 2019 3RD INTERNATIONAL CONFERENCE ON APPLIED AUTOMATION AND INDUSTRIAL DIAGNOSTICS (ICAAID 2019), 2019,
  • [2] Minimizing makespan on a single batching machine with release times and non-identical job sizes
    Li, SG
    Li, GJ
    Wang, XL
    Liu, QM
    [J]. OPERATIONS RESEARCH LETTERS, 2005, 33 (02) : 157 - 164
  • [3] Minimizing makespan on parallel machines subject to release dates and delivery times
    Gharbi, A
    Haouari, M
    [J]. JOURNAL OF SCHEDULING, 2002, 5 (04) : 329 - 355
  • [4] A LISTFIT heuristic for minimizing makespan on identical parallel machines
    Gupta, JND
    Ruiz-Torres, J
    [J]. PRODUCTION PLANNING & CONTROL, 2001, 12 (01) : 28 - 36
  • [5] Minimizing makespan on identical parallel machines using neural networks
    Akyol, Derya Eren
    Bayhan, G. Mirac
    [J]. NEURAL INFORMATION PROCESSING, PT 3, PROCEEDINGS, 2006, 4234 : 553 - 562
  • [6] Minimizing the makespan on two identical parallel machines with mold constraints
    Chung, Tsuiping
    Gupta, Jatinder N. D.
    Zhao, Haidan
    Werner, Frank
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 105 : 141 - 155
  • [7] Minimizing the makespan on a single parallel batching machine
    Lu, Shenpeng
    Feng, Haodi
    Li, Xiuqian
    [J]. THEORETICAL COMPUTER SCIENCE, 2010, 411 (7-9) : 1140 - 1145
  • [8] Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
    Sun, Ruiqing
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (03)
  • [9] Minimizing makespan subject to minimum flowtime on two identical parallel machines
    Gupta, JND
    Ho, JC
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2001, 28 (07) : 705 - 717
  • [10] Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
    Ruiqing Sun
    [J]. Journal of Combinatorial Optimization, 2024, 47
12345