A property-based hybrid genetic algorithm and tabu search for solving order acceptance and scheduling problem with trapezoidal penalty membership function

被引:8
作者
Zhao, Ziye [1 ]
Chen, Xiaohui [1 ]
An, Youjun [1 ]
Li, Yinghe [1 ]
Gao, Kaizhou [2 ,3 ]
机构
[1] Chongqing Univ, Coll Mech & Vehicle Engn, Chongqing 400030, Peoples R China
[2] Macau Univ Sci & Technol, Macau Inst Syst Engn, Macau 999078, Peoples R China
[3] Liaocheng Univ, Sch Comp Sci, Liaocheng 252000, Peoples R China
基金
中国国家自然科学基金; 国家重点研发计划;
关键词
Order acceptance and scheduling; Trapezoidal earliness; tardiness penalty; membership function; Common due window; Property-based hybrid algorithm; SHOP; OPTIMIZATION; FLOWSHOPS;
D O I
10.1016/j.eswa.2023.119598
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To improve the profitability and customer satisfaction, in make-to-order environment, manufacturers need to simultaneously consider which orders should be accepted and how to arrange these accepted orders for production, i.e., order acceptance and scheduling (OAS) problem. In practice, orders are often expected to be completed in a certain time interval, but the existing OAS-related studies mainly focus on the hard due date. Therefore, this study is dedicated to solving a single-machine OAS problem that considers the earliness/tardiness penalty under the common due window to maximize the total net profit (TNP), and the main innovative works are described as follows: (1) a trapezoidal earliness/tardiness penalty membership function under the common due window is designed, and a mathematical model is established to characterize the concerned problem; (2) six problem-specific properties are derived for determining which orders to be accepted or rejected, arranging the processing sequence and deciding the start processing time for these accepted orders; and (3) an effective property-based hybrid algorithm (GATS-SSRIR) is designed to deal with the concerned problem, which hybridizes the genetic algorithm, tabu search and six problem-specific properties. In numerical experiments, Taguchi method is first employed to optimize the parameter setting of GATS-SSRIR under different initialization methods. Second, the effectiveness of the proposed problem-specific properties is verified by comparing with other strategies, and the average improvement is 45.3%. Next, the superiority of the proposed GATS-SSRIR algorithm is demonstrated by algorithm comparison, and the average improvement is 67.3%. Finally, a sensitivity analysis on the common due window is performed. To sum up, the proposed problem properties and GATS-SSRIR algorithm are efficient and benefit, and the length of due window has a significant impact on the TNP.
引用
收藏
页数:18
相关论文
共 49 条
  • [31] Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling
    Naderi, Bahman
    Roshanaei, Vahid
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2020, 286 (03) : 811 - 827
  • [32] Bicriteria order acceptance and scheduling with consideration of fill rate
    Ou, Jinwen
    Zhong, Xueling
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 262 (03) : 904 - 907
  • [33] Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
    Pan, Quan-Ke
    Ruiz, Ruben
    Alfaro-Fernandez, Pedro
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 80 : 50 - 60
  • [34] Solving Biobjective Distributed Flow-Shop Scheduling Problems With Lot-Streaming Using an Improved Jaya Algorithm
    Pan, Yuxia
    Gao, Kaizhou
    Li, Zhiwu
    Wu, Naiqi
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2023, 53 (06) : 3818 - 3828
  • [35] Structural properties and algorithms for earliness and tardiness scheduling against common due dates and windows: A review
    Rolim, Gustavo Alencar
    Nagano, Marcelo Seido
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2020, 149
  • [36] Order acceptance using genetic algorithms
    Rom, Walter O.
    Slotnick, Susan A.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 1758 - 1767
  • [37] Selecting jobs for a heavily loaded shop with lateness penalties
    Slotnick, SA
    Morton, TE
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (02) : 131 - 140
  • [38] A matheuristic for the generalized order acceptance and scheduling problem
    Tarhan, Istenc
    Oguz, Ceyda
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 299 (01) : 87 - 103
  • [39] Order acceptance and scheduling with earliness and tardiness penalties
    Thevenin, Simon
    Zufferey, Nicolas
    Widmer, Marino
    [J]. JOURNAL OF HEURISTICS, 2016, 22 (06) : 849 - 890
  • [40] Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
    Wan, GH
    Yen, BMPC
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2002, 142 (02) : 271 - 281