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

被引:4
|
作者
Nasrollahi, Vahid [1 ]
Moslehi, Ghasem [1 ]
Reisi-Nafchi, Mohammad [1 ]
机构
[1] Isfahan Univ Technol, Dept Ind & Syst Engn, Esfahan 8415683111, Iran
关键词
Maximum earliness; Maximum tardiness; Two-agent scheduling; Number of tardy jobs; Flow shop; MACHINE; SEARCH;
D O I
10.1007/s12351-020-00577-3
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In the past decade, multi-agent scheduling studies have become more widespread. However, the evaluation of these issues in the flow shop scheduling environment has received almost no attention. In this article, we investigate two problems. One problem is a common due date problem of constrained two-agent scheduling of jobs in a two-machine flow shop environment to minimize the weighted sum of maximum earliness and maximum tardiness of first-agent jobs and restrictions of non-eligibility on the tardiness of second-agent jobs. Another problem is a single-agent form of the two-agent problem when the number of second-agent jobs is zero. So, an optimal algorithm with polynomial time complexity is presented for the single-agent problem. For the two-agent problem, after it was shown to have minimum complexity of ordinary NP-hardness, a branch and bound algorithm, based on efficient lower and upper bounds and dominance rules, was developed. The computational results show that the algorithm can solve the large-size instances optimally.
引用
收藏
页码:1403 / 1442
页数:40
相关论文
共 50 条
  • [1] 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
    [J]. Operational Research, 2022, 22 : 1403 - 1442
  • [2] Two-machine flow shop scheduling to minimize the sum of maximum earliness and tardiness
    Moslehi, G.
    Mirzaee, M.
    Vasei, M.
    Modarres, M.
    Azaron, A.
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2009, 122 (02) : 763 - 773
  • [3] A lion optimisation algorithm for a two-agent single-machine scheduling with periodic maintenance to minimise the sum of maximum earliness and tardiness
    Yazdani, Reza
    Mirmozaffari, Mirpouya
    Shadkam, Elham
    Khalili, Seyed Mohammad
    [J]. International Journal of Industrial and Systems Engineering, 2023, 44 (04) : 515 - 531
  • [4] Two-agent scheduling in a two-machine open shop
    Liu, Peihai
    Gu, Manzhan
    Lu, Xiwen
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024, 333 (01) : 275 - 301
  • [5] Two-machine flow shop scheduling with two criteria:: Maximum earliness and makespan
    Toktas, B
    Azizoglu, M
    Köksalan, SK
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (02) : 286 - 295
  • [6] Two-agent scheduling in a two-machine open shop
    Peihai Liu
    Manzhan Gu
    Xiwen Lu
    [J]. Annals of Operations Research, 2024, 333 : 275 - 301
  • [7] A two-agent scheduling problem in a two-machine flowshop
    Ahmadi-Darani, Mohammad-Hasan
    Moslehi, Ghasem
    Reisi-Nafchi, Mohammad
    [J]. INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING COMPUTATIONS, 2018, 9 (03) : 289 - 306
  • [8] Minimizing the weighted sum of maximum earliness and maximum tardiness costs on a single machine with periodic preventive maintenance
    Benmansour, Rachid
    Allaoui, Hamid
    Artiba, Abdelhakim
    Hanafi, Said
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 47 : 106 - 113
  • [9] Optimizing the sum of maximum earliness and tardiness of the job shop scheduling problem
    Yazdani, Maziar
    Aleti, Aldeida
    Khalili, Seyed Mohammad
    Jolai, Fariborz
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2017, 107 : 12 - 24
  • [10] Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time
    Nekoiemehr, N.
    Moslehi, G.
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2011, 62 (07) : 1403 - 1412