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 条
  • [11] Two-machine robotic cell scheduling problem with sequence-dependent setup times
    Zarandi, M. H. Fazel
    Mosadegh, H.
    Fattahi, M.
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (05) : 1420 - 1434
  • [12] An improved two-machine flowshop scheduling with intermediate transportation
    Dong, Jianming
    Wang, Xueshi
    Hu, Jueliang
    Lin, Guohui
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2016, 31 (03) : 1316 - 1334
  • [13] An improved two-machine flowshop scheduling with intermediate transportation
    Jianming Dong
    Xueshi Wang
    Jueliang Hu
    Guohui Lin
    Journal of Combinatorial Optimization, 2016, 31 : 1316 - 1334
  • [14] A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times
    Yuan, Shuaipeng
    Li, Tieke
    Wang, Bailin
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 152
  • [15] A better approximation for the two-machine flowshop scheduling problem with time lags
    Karuno, Y
    Nagamochi, H
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 309 - 318
  • [16] Two-machine flowshop scheduling with bicriteria problem
    Chou, FD
    Lee, CE
    COMPUTERS & INDUSTRIAL ENGINEERING, 1999, 36 (03) : 549 - 564
  • [17] Two-machine flowshop dynamic scheduling problem
    Chou, Fuh-Der
    Lee, Ching-En
    Kung Yeh Kung Chieng Hsueh K'an/Journal of the Chinese Institute of Industrial Engineers, 1998, 15 (04): : 315 - 324
  • [18] Two-machine flowshop scheduling problem to minimize maximum lateness with bounded setup and processing times
    Allahverdi, Ali
    KUWAIT JOURNAL OF SCIENCE & ENGINEERING, 2006, 33 (02): : 233 - 252
  • [19] Minimizing the mean flow time in a two-machine group-scheduling problem with carryover sequence dependency
    Logendran, R
    Gelogullari, CA
    Sriskandarajah, C
    ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2003, 19 (1-2) : 21 - 33
  • [20] Using genetic algorithm in two-machine flexible flow-shop scheduling with setup times
    Huang, Shien-Ping
    JOURNAL OF INFORMATION & OPTIMIZATION SCIENCES, 2010, 31 (01): : 87 - 103