Research on Online Production Scheduling of Steel Box Girder Section with Degradation Effect
YANG Xiaohua1, MA Ran1, ZHANG Yuzhong2
1. School of Management Engineering, Qingdao University of Technology, Qingdao 266520, China; 2. Institute of Operations Research, School of Management, Qufu Normal University, Rizhao 276826, China
YANG Xiaohua, MA Ran, ZHANG Yuzhong. Research on Online Production Scheduling of Steel Box Girder Section with Degradation Effect[J]. Operations Research and Management Science, 2024, 33(8): 37-43.
[1] 田林杰,杨明,常山,等.采用支撑杆件提高钢箱梁正交异性板疲劳性能研究[J].建筑结构学报,2021,42(11):97-104. [2] 易有淼,樊少彻.港珠澳大桥青州航道桥钢箱梁施工关键技术[J].桥梁建设,2021,51(3):138-144. [3] KAVEH A, BAKHSHPOORI T, BARKHORI M. Optimum design of multi-span composite box girder bridges using Cuckoo Search algorithm[J]. Steel and Composite Structures, 2014, 17(5): 703-717. [4] KAVEH A, MAHJOUBI S. Design of muti-span steel box girder using lion pride optimization algorithm[J]. Smart Structures and Systems , 2017, 20(5): 607-618. [5] 桂玲,谢勇,王红卫.钢箱梁生产的提前/拖期调度问题研究[J].系统工程理论与实践,2017,37(5):1274-1281. [6] 王镇.钢箱梁小节段生产调度优化模型及算法研究[D].武汉:华中科技大学,2020. [7] MOR B, MOSHEIOV G. Minimizing total load on parallel machines with linear deterioration[J]. Optimization Letters, 2020, 14(3): 771-779. [8] WU X L, SHEN X L, LI C B. The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously[J]. Computers & Industrial Engineering, 2019, 135: 1004-1024. [9] DELORME M, IORI M, MENDES N F M. Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events[J]. European Journal of Operational Research, 2021, 295(3): 823-837. [10] BROENE S, YECHIALI U. Scheduling deteriorating jobs on a single processor[J]. Operations Research, 1990, 38(3): 495-498. [11] GUPTA J N D, GUPTA S K. Single facility scheduling with nonlinear processing times[J]. Computers & Industrial Engineering, 1988, 14(4): 387-393. [12] XUAN H, ZHANG H X, LI B. An improved discrete artificial bee colony algorithm for flexible flowshop scheduling with step deteriorating jobs and sequence-dependent setup times[J]. Mathematical Problems in Engineering, 2019, 2019: 8520503. [13] LIU M, ZHENG F F, WANG S J, et al. Optimal algorithms for online single machine scheduling with deteriorating jobs[J]. Theoretical Computer Science, 2012, 445: 75-81 [14] MA R, TAO J P, YUAN J J. Online scheduling with linear deteriorating jobs to minimize the total weighted completion time[J]. Applied Mathematics and Computation, 2016, 273: 570-583. [15] YE H H, LI W, NAULT B R. Trade-off balancing between maximum and total completion times for no-wait flow shop production[J]. International Journal of Production Research, 2020, 58(11): 3235-3251. [16] ALLAHVERDI A. A survey of scheduling problems with no-wait in process[J]. European Journal of Operational Research, 2016 , 255(3): 665-686. [17] HE C, XU C Q, LIN H. Serial-batching scheduling with two agents to minimize makespan and maximum cost[J]. Journal of Scheduling, 2020, 23(5): 609-617. [18] LI W J. A best possible online algorithm for the parallel-machine scheduling to minimize the maximum weighted completion time[J]. Asia-Pacific Journal of Operational Research, 2015, 32(4): 1550030. [19] CHAI X, LU L F, LI W H, et al. Best-possible online algorithms for single machine scheduling to minimize the maximum weighted completion time[J]. Asia-Pacific Journal of Operational Research, 2018, 35(6): 1850048. [20] LI W H, CHAI X. Online scheduling on bounded batch machines to minimize the maximum weighted completion time[J]. Journal of the Operations Research Society of China, 2018, 6(3): 455-465. [21] GRAHAM R L, LAWLER EL, LENSTRA J K, et al. Optimization and approximation in deterministic sequencing and scheduling: A survey[J]. Annals of Discrete Mathematics, 1979, 5(1): 287-326. [22] WANG J B, XIA Z Q. Scheduling jobs under decreasing linear deterioration[J]. Information Processing Letters, 2005, 94(2): 63-69. [23] GAWIEJNOWICZ S. A review of four decades of time-dependent scheduling: Main results, new topics, and open problems[J]. Journal of Scheduling, 2020, 23(1): 3-47.