Parallel-Batch Scheduling with Two Models of Deterioration to Minimize the Makespan

被引：1
|
作者：
Miao, Cuixia [1 ,2 ]
机构：
[1] Qufu Normal Univ, Sch Math Sci, Qufu 273165, Shandong, Peoples R China
[2] Qufu Normal Univ, Sch Phys & Engn, Qufu 273165, Shandong, Peoples R China
来源：
ABSTRACT AND APPLIED ANALYSIS | 2014年
基金：
中国国家自然科学基金;
关键词：
PROCESSING TIMES; SINGLE; JOBS;
D O I：
10.1155/2014/495187
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider the bounded parallel-batch scheduling with two models of deterioration, in which the processing time of the first model is p(j) = a(j) + alpha t and of the second model is p(j) = a + alpha(j)t The objective is to minimize the makespan. We present O(nlogn) time algorithms for the single-machine problems, respectively. And we propose fully polynomial time approximation schemes to solve the identical-parallel-machine problem and uniform-parallel-machine problem, respectively.
引用
收藏
页数：10
相关论文
共 50 条
  • [41] Online Scheduling on a Parallel-Batch Machine With Pulse Interruptions
    Lin, Ran
    Wang, Jun-Qiang
    Liu, Zhixin
    Xu, Jun
    NAVAL RESEARCH LOGISTICS, 2025,
  • [42] Single machine parallel-batch scheduling with deteriorating jobs
    Qi, Xianglai
    Zhou, Shiguo
    Yuan, Jinjiang
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 830 - 836
  • [43] Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
    Zhao, Kejun
    Lu, Xiwen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (01) : 260 - 278
  • [44] Scheduling two-point stochastic jobs to minimize the makespan on two parallel machines
    Borst, S
    Bruno, J
    Coffman, EG
    Phillips, S
    PROBABILITY IN THE ENGINEERING AND INFORMATIONAL SCIENCES, 1997, 11 (01) : 95 - 105
  • [45] Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
    Kejun Zhao
    Xiwen Lu
    Journal of Combinatorial Optimization, 2016, 31 : 260 - 278
  • [46] Two Parallel Machines Scheduling with Two-Vehicle Job Delivery to Minimize Makespan
    Cao, Lisi
    Hao, Jianhong
    Jiang, Dakui
    COMPLEXITY, 2020, 2020
  • [47] An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
    Liu, Ming
    Zheng, Feifeng
    Chu, Chengbin
    Zhang, Jiantong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 23 (04) : 483 - 492
  • [48] An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration
    Ming Liu
    Feifeng Zheng
    Chengbin Chu
    Jiantong Zhang
    Journal of Combinatorial Optimization, 2012, 23 : 483 - 492
  • [49] RESEARCH ON THE PARALLEL-BATCH SCHEDULING WITH LINEARLY LOOKAHEAD MODEL
    Jiao, Chengwen
    Feng, Qi
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2021, 17 (06) : 3551 - 3558
  • [50] On-Line Scheduling on Parallel Machines to Minimize the Makespan
    Songsong Li
    Yuzhong Zhang
    Journal of Systems Science and Complexity, 2016, 29 : 472 - 477
12345