Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs

被引：26
|
作者：
Miao, Cuixia [1 ]
Zhang, Yuzhong [2 ]
Cao, Zhigang [3 ]
机构：
[1] Qufu Normal Univ, Sch Math Sci, Qufu 273165, Shandong, Peoples R China
[2] Qufu Normal Univ, Sch Management, Rizhao 276826, Shandong, Peoples R China
[3] CAS, Key Lab Management Decis & Informat Syst AMSS, Beijing 100190, Peoples R China
来源：
INFORMATION PROCESSING LETTERS | 2011年 / 111卷 / 16期
基金：
中国国家自然科学基金;
关键词：
Analysis of algorithms; Parallel-batch scheduling; Deteriorating job; NP-hard; Fully polynomial time approximation scheme (FPTAS); SIMPLE LINEAR DETERIORATION; PROCESSING TIMES;
D O I：
10.1016/j.ipl.2011.05.018
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We consider the bounded parallel-batch scheduling problem in which the processing time of a job is a simple linear function of its starting time. The objective is to minimize the makespan. When the jobs have identical release dates, we present an optimal algorithm for the single-machine problem and an fully polynomial-time approximation scheme for the parallel-machine problem. When the jobs have distinct release dates, we show that the single-machine problem is NP-hard and present an optimal algorithm for one special case. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码：798 / 803
页数：6
相关论文
共 50 条
  • [1] Single machine parallel-batch scheduling with deteriorating jobs
    Qi, Xianglai
    Zhou, Shiguo
    Yuan, Jinjiang
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 830 - 836
  • [2] Bounded Parallel-Batch Scheduling on Unrelated Parallel Machines
    Miao, Cuixia
    Zhang, Yuzhong
    Wang, Chengfei
    [J]. ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, 2010, 6124 : 220 - 228
  • [3] Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
    Li, Shisheng
    Ng, C. T.
    Cheng, T. C. E.
    Yuan, Jinjiang
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 210 (03) : 482 - 488
  • [4] A Coordination Mechanism for Scheduling Game on Parallel-Batch Machines with Deterioration Jobs
    Yu, Ganhua
    [J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2022, 2022
  • [5] Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead
    Li, Wenhua
    Zhang, Zhenkun
    Yang, Sufang
    [J]. INFORMATION PROCESSING LETTERS, 2012, 112 (07) : 292 - 297
  • [6] Online Algorithms for Scheduling Unit Length Jobs on Unbounded Parallel-Batch Machines with Linearly Lookahead
    Jiao, Chengwen
    Yuan, Jinjiang
    Feng, Qi
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2019, 36 (05)
  • [7] Bounded single-machine parallel-batch scheduling with release dates and rejection
    Lu, Lingfa
    Cheng, T. C. E.
    Yuan, Jinjiang
    Zhang, Liqi
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (10) : 2748 - 2751
  • [8] Unbounded parallel-batch scheduling with family jobs and delivery coordination
    Li, Shisheng
    Yuan, Jinjiang
    Fan, Baoqiang
    [J]. INFORMATION PROCESSING LETTERS, 2011, 111 (12) : 575 - 582
  • [9] A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
    Gao, Yuan
    Yuan, Jinjiang
    Ng, C. T.
    Cheng, T. C. E.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 273 (01) : 74 - 81
  • [10] Parallel machines scheduling with deteriorating jobs and availability constraints
    Zhao, Chuanli
    Tang, Hengyong
    [J]. JAPAN JOURNAL OF INDUSTRIAL AND APPLIED MATHEMATICS, 2014, 31 (03) : 501 - 512
12345