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 条
  • [21] Competitive Two-Agent Scheduling and Its Applications
    Leung, Joseph Y. -T.
    Pinedo, Michael
    Wan, Guohua
    OPERATIONS RESEARCH, 2010, 58 (02) : 458 - 469
  • [22] Two-agent single-machine scheduling to minimize the batch delivery cost
    Yin, Yunqiang
    Wang, Yan
    Cheng, T. C. E.
    Wang, Du-Juan
    Wu, Chin-Chia
    COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 92 : 16 - 30
  • [23] Two-agent single-machine scheduling with release dates to minimize the makespan
    Jin Yu
    Peihai Liu
    Xiwen Lu
    Optimization Letters, 2023, 17 : 1915 - 1937
  • [24] Some two-agent single-machine scheduling problems to minimize minmax and minsum of completion times
    Xiaoling Cao
    Wen-Hsing Wu
    Wen-Hung Wu
    Chin-Chia Wu
    Operational Research, 2018, 18 : 293 - 314
  • [25] Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem
    Vahid Nasrollahi
    Ghasem Moslehi
    Mohammad Reisi-Nafchi
    Operational Research, 2022, 22 : 1403 - 1442
  • [26] Minimizing the weighted sum of maximum earliness and maximum tardiness in a single-agent and two-agent form of a two-machine flow shop scheduling problem
    Nasrollahi, Vahid
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    OPERATIONAL RESEARCH, 2022, 22 (02) : 1403 - 1442
  • [27] Price of fairness in two-agent single-machine scheduling problems
    Agnetis, Alessandro
    Chen, Bo
    Nicosia, Gaia
    Pacifici, Andrea
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 276 (01) : 79 - 87
  • [28] Competitive Two-Agent Scheduling with Learning Effect and Release Times on a Single Machine
    Li, Der-Chiang
    Hsu, Peng-Hsiang
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
  • [29] Two-machine flowshop scheduling to minimize total tardiness
    Pan, JCH
    Fan, ET
    INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE, 1997, 28 (04) : 405 - 414
  • [30] Two-agent single-machine scheduling to minimize resource consumption with a constraint on the makespan
    Liu, Peng P
    Tian, Xiaoyu
    PROCEEDINGS OF 2013 6TH INTERNATIONAL CONFERENCE ON INFORMATION MANAGEMENT, INNOVATION MANAGEMENT AND INDUSTRIAL ENGINEERING (ICIII 2013) VOL 1, 2013, : 487 - 489
12345