Model and Algorithm for a Two-Machine Group Scheduling Problem with Setup and Transportation Time

被引:0
|
作者
Ni, Yu [1 ]
Dai, Shufen [1 ]
Yuan, Shuaipeng [1 ]
Wang, Bailin [1 ]
Zhang, Zhuolun [1 ]
机构
[1] Univ Sci & Technol Beijing, Sch Econ & Management, 30 Xueyuan Rd, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
group scheduling; transportation time; mathematical model; heuristic algorithm; 90-10;
D O I
10.3390/math12060888
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
This paper investigates a two-machine group scheduling problem with sequence-independent setup times and round-trip transportation times, which is derived from the production management requirements of modern steel manufacturing enterprises. The objective is to minimize the makespan. Addressing limitations in prior studies, we consider a critical but largely ignored transportation method, namely round-trip transportation, and restricted transporter capacity between machines. To solve this problem, a mixed-integer programming model is first developed. Then, the problem complexity is analyzed for situations with both single and unlimited transporters. For the NP-hard case of a single transporter, we design an efficient two-stage heuristic algorithm with proven acceptable solution quality bounds. Extensive computational experiments based on steel plant data demonstrate the effectiveness of our approach in providing near-optimal solutions, and the maximum deviation between our algorithm and the optimal solution is 1.38%. This research can provide an operable optimization method that is valuable for group scheduling and transportation scheduling.
引用
收藏
页数:12
相关论文
共 50 条
  • [41] Two-machine interval shop scheduling with time lags
    Zhang, Xiandong
    van de Velde, Steef
    JOURNAL OF SCHEDULING, 2015, 18 (04) : 359 - 368
  • [42] Two-machine interval shop scheduling with time lags
    Xiandong Zhang
    Steef van de Velde
    Journal of Scheduling, 2015, 18 : 359 - 368
  • [43] Approximation algorithms for two-machine flow shop scheduling with batch setup times
    Bo Chen
    Chris N. Potts
    Vitaly A. Strusevich
    Mathematical Programming, 1998, 82 : 255 - 271
  • [44] Heuristic and Exact Algorithms for the Two-Machine Just in Time Job Shop Scheduling Problem
    Al-Salem, Mohammed
    Bedoya-Valencia, Leonardo
    Rabadi, Ghaith
    MATHEMATICAL PROBLEMS IN ENGINEERING, 2016, 2016
  • [45] The two-machine flowshop scheduling problem with sequence-independent setup times: New lower bounding strategies
    Gharbi, Anis
    Ladhari, Talel
    Msakni, Mohamed Kais
    Serairi, Mehdi
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2013, 231 (01) : 69 - 78
  • [46] A two-machine flowshop scheduling problem with precedence constraint on two jobs
    Cheng, Shuenn-Ren
    Yin, Yunqiang
    Wen, Chih-Hou
    Lin, Win-Chin
    Wu, Chin-Chia
    Liu, Jun
    SOFT COMPUTING, 2017, 21 (08) : 2091 - 2103
  • [47] Approximation algorithms for two-machine flow shop scheduling with batch setup times
    Chen, Bo
    Potts, Chris N.
    Strusevich, Vitaly A.
    Mathematical Programming, Series B, 1998, 82 (1-2): : 255 - 271
  • [48] Approximation algorithms for two-machine flow shop scheduling with batch setup times
    Chen, B
    Potts, CN
    Strusevich, VA
    MATHEMATICAL PROGRAMMING, 1998, 82 (1-2) : 255 - 271
  • [49] An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint
    Wang, Xiuli
    Cheng, T. C. Edwin
    COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (10) : 2894 - 2901
  • [50] A two-machine flowshop scheduling problem with precedence constraint on two jobs
    Shuenn-Ren Cheng
    Yunqiang Yin
    Chih-Hou Wen
    Win-Chin Lin
    Chin-Chia Wu
    Jun Liu
    Soft Computing, 2017, 21 : 2091 - 2103