Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan

被引：0
|
作者：
Cheng He
Hao Lin
Yixun Lin
Ji Tian
机构：
[1] Henan University of Technology,School of Science
[2] Zhengzhou University,Department of Mathematics
[3] China University of Mining and Technology,School of Science
来源：
Central European Journal of Operations Research | 2013年 / 21卷
关键词：
Multicriteria scheduling; Batching machine; Maximum lateness; Pareto optimal solutions; 68Q25; 90B35; 90B50;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper studies the bicriteria problem of scheduling n jobs on a serial-batching machine to minimize maximum cost and makespan simultaneously. A serial-batching machine is a machine that can handle up to b jobs in a batch and jobs in a batch start and complete respectively at the same time and the processing time of a batch is equal to the sum of the processing times of jobs in the batch. When a new batch starts, a constant setup time s occurs. We confine ourselves to the unbounded model, where b ≥ n. We present a polynomial-time algorithm for finding all Pareto optimal solutions of this bicriteria scheduling problem.
引用
收藏
页码：177 / 186
页数：9
相关论文
共 50 条
  • [1] Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
    He, Cheng
    Lin, Hao
    Lin, Yixun
    Tian, Ji
    [J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2013, 21 (01) : 177 - 186
  • [2] Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan
    He, Cheng
    Lin, Yixun
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 381 (1-3) : 234 - 240
  • [3] BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN
    He, Cheng
    Lin, Hao
    Yuan, Jinjiang
    Mu, Yundong
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (04)
  • [4] Serial-batching scheduling with two agents to minimize makespan and maximum cost
    He, Cheng
    Xu, Chunqi
    Lin, Hao
    [J]. JOURNAL OF SCHEDULING, 2020, 23 (05) : 609 - 617
  • [5] Serial-batching scheduling with two agents to minimize makespan and maximum cost
    Cheng He
    Chunqi Xu
    Hao Lin
    [J]. Journal of Scheduling, 2020, 23 : 609 - 617
  • [6] Scheduling a single machine with parallel batching to minimize makespan and total rejection cost
    He, Cheng
    Leung, Joseph Y. -T.
    Lee, Kangbok
    Pinedo, Michael L.
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 204 : 150 - 163
  • [7] An improved algorithm on unbounded parallel-batching scheduling to minimize maximum cost and makespan
    He, Cheng
    Wu, Jing
    Xu, Jinglei
    Wang, Junling
    [J]. RAIRO-OPERATIONS RESEARCH, 2023, 57 (02) : 731 - 741
  • [8] Batching and scheduling to minimize the makespan in the two-machine flowshop
    Cheng, TCE
    Wang, GQ
    [J]. IIE TRANSACTIONS, 1998, 30 (05) : 447 - 453
  • [9] A DP algorithm for minimizing makespan and total completion time on a series-batching machine
    He, Cheng
    Lin, Yixun
    Yuan, Jinjiang
    [J]. INFORMATION PROCESSING LETTERS, 2009, 109 (12) : 603 - 607
  • [10] Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
    Li, Shuguang
    Geng, Zhichao
    [J]. INFORMATION PROCESSING LETTERS, 2023, 180
12345