Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine openshop

被引：8
|
作者：
Jiang, Fuhong [1 ,2 ]
Zhang, Xingong [1 ,2 ]
Bai, Danyu [3 ]
Wu, Chin-Chia [4 ]
机构：
[1] Chongqing Normal Univ, Coll Math Sci, Chongqing, Peoples R China
[2] Minist Educ, Key Lab Optimizat & Control, Chongqing, Peoples R China
[3] Shengyang Univ Chem Technol, Sch Econ & Management, Shenyang, Peoples R China
[4] Feng Chia Univ, Dept Stat, Taichung, Taiwan
来源：
ENGINEERING OPTIMIZATION | 2018年 / 50卷 / 04期
基金：
中国国家自然科学基金;
关键词：
Two competitive agents; open-shop scheduling; makespan; approximation algorithm; OPEN SHOP; SINGLE-MACHINE; AGENTS; TIME;
D O I：
10.1080/0305215X.2017.1332762
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this article, a competitive two-agent scheduling problem in a two-machine open shop is studied. The objective is to minimize the weighted sum of the makespans of two competitive agents. A complexity proof is presented for minimizing the weighted combination of the makespan of each agent if the weight belonging to agent B is arbitrary. Furthermore, two pseudo-polynomial-time algorithms using the largest alternate processing time (LAPT) rule are presented. Finally, two approximation algorithms are presented if the weight is equal to one. Additionally, another approximation algorithm is presented if the weight is larger than one.
引用
收藏
页码：684 / 697
页数：14
相关论文
共 50 条
  • [1] Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents’ makespans
    Cui-Lin Zhang
    Jun-Qiang Wang
    Cheng-Wu Zhang
    Journal of Ambient Intelligence and Humanized Computing, 2019, 10 : 999 - 1007
  • [2] Two-agent scheduling on a single parallel-batching machine to minimize the weighted sum of the agents' makespans
    Zhang, Cui-Lin
    Wang, Jun-Qiang
    Zhang, Cheng-Wu
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2019, 10 (03) : 999 - 1007
  • [3] Two-agent scheduling in a two-machine open shop
    Liu, Peihai
    Gu, Manzhan
    Lu, Xiwen
    ANNALS OF OPERATIONS RESEARCH, 2024, 333 (01) : 275 - 301
  • [4] A two-agent scheduling problem in a two-machine flowshop
    Ahmadi-Darani, Mohammad-Hasan
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (03) : 289 - 306
  • [5] Two-agent scheduling in a two-machine open shop
    Peihai Liu
    Manzhan Gu
    Xiwen Lu
    Annals of Operations Research, 2024, 333 : 275 - 301
  • [6] Two-agent two-machine flowshop scheduling with learning effects to minimize the total completion time
    Shiau, Yau-Ren
    Tsai, Ming-Shua
    Lee, Wen-Chiung
    Cheng, T. C. E.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 87 : 580 - 589
  • [7] Two-agent scheduling problems on a single-machine to minimize the total weighted late work
    Zhang Xingong
    Wang Yong
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (03) : 945 - 955
  • [8] Two-agent scheduling problems on a single-machine to minimize the total weighted late work
    Zhang Xingong
    Wang Yong
    Journal of Combinatorial Optimization, 2017, 33 : 945 - 955
  • [9] Algorithms for a two-agent single machine scheduling problem to minimize weighted number of tardy jobs
    Li, Jiaji
    Gajpal, Yuvraj
    Appadoo, Srimantoorao S.
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2021, 42 (04): : 785 - 811
  • [10] Two-agent single-machine scheduling to minimize the weighted sum of the agents' objective functions
    Cheng, T. C. E.
    Liu, Chih-Yu
    Lee, Wen-Chiung
    Ji, M.
    COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 78 : 66 - 73
12345