Serial-batching scheduling with two agents to minimize makespan and maximum cost

被引：13
|
作者：
He, Cheng [1 ]
Xu, Chunqi [2 ]
Lin, Hao [1 ]
机构：
[1] Henan Univ Technol, Sch Sci, Zhengzhou 450001, Henan, Peoples R China
[2] China Univ Geosci Beijing, Sch Econ & Management, Beijing 100083, Peoples R China
来源：
JOURNAL OF SCHEDULING | 2020年 / 23卷 / 05期
关键词：
Two-agent scheduling; Serial-batching; Makespan; Maximum cost; Maximum lateness; SINGLE-MACHINE;
D O I：
10.1007/s10951-020-00656-5
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
This paper considers three serial-batching scheduling problems with two agents to minimize the makespan of agent A and maximum cost (or maximum lateness) of agent B simultaneously. In these two-agent scheduling problems, jobs of different agents cannot be processed in a common batch, and the cost function of an agent depends only on its jobs. For each problem, we present a polynomial-time algorithm which can find all Pareto optimal solutions.
引用
收藏
页码：609 / 617
页数：9
相关论文
共 50 条
  • [31] Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost
    Wan, Long
    Yuan, Jinjiang
    Wei, Lijun
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2016, 273 : 912 - 923
  • [32] Two-Agent Scheduling on a Bounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives
    Feng, Qi
    Shang, Wei-Ping
    Jiao, Cheng-Wen
    Li, Wen-Jie
    [J]. JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2020, 8 (01) : 189 - 196
  • [33] Two-Agent Scheduling on a Bounded Parallel-Batching Machine with Makespan and Maximum Lateness Objectives
    Qi Feng
    Wei-Ping Shang
    Cheng-Wen Jiao
    Wen-Jie Li
    [J]. Journal of the Operations Research Society of China, 2020, 8 : 189 - 196
  • [34] Scheduling two agents on uniform parallel machines with makespan and cost functions
    Donatas Elvikis
    Horst W. Hamacher
    Vincent T’kindt
    [J]. Journal of Scheduling, 2011, 14 : 471 - 481
  • [35] Scheduling two agents on uniform parallel machines with makespan and cost functions
    Elvikis, Donatas
    Hamacher, Horst W.
    T'kindt, Vincent
    [J]. JOURNAL OF SCHEDULING, 2011, 14 (05) : 471 - 481
  • [36] Integrated production and delivery scheduling on a serial batch machine to minimize the makespan
    Lu, Lingfa
    Zhang, Liqi
    Wan, Long
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 572 : 50 - 57
  • [37] Online scheduling on two uniform machines to minimize the makespan
    Liu, Ming
    Xu, Yinfeng
    Chu, Chengbin
    Zheng, Feifeng
    [J]. THEORETICAL COMPUTER SCIENCE, 2009, 410 (21-23) : 2099 - 2109
  • [38] Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
    Jun Pei
    Xinbao Liu
    Wenjuan Fan
    Panos M. Pardalos
    Athanasios Migdalas
    Shanlin Yang
    [J]. Annals of Mathematics and Artificial Intelligence, 2016, 76 : 215 - 228
  • [39] 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
  • [40] Scheduling jobs on a single serial-batching machine with dynamic job arrivals and multiple job types
    Pei, Jun
    Liu, Xinbao
    Fan, Wenjuan
    Pardalos, Panos M.
    Migdalas, Athanasios
    Yang, Shanlin
    [J]. ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2016, 76 (1-2) : 215 - 228
12345