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 条
  • [1] An Y. J., 2023, SWARM EVOL COMPUT, V77
  • [2] A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance
    An, Youjun
    Chen, Xiaohui
    Gao, Kaizhou
    Zhang, Lin
    Li, Yinghe
    Zhao, Ziye
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2023, 212
  • [3] Joint optimization of preventive maintenance and production rescheduling with new machine insertion and processing speed selection
    An, Youjun
    Chen, Xiaohui
    Hu, Jiawen
    Zhang, Lin
    Li, Yinghe
    Jiang, Junwei
    [J]. RELIABILITY ENGINEERING & SYSTEM SAFETY, 2022, 220
  • [4] Multiobjective Flexible Job-Shop Rescheduling With New Job Insertion and Machine Preventive Maintenance
    An, Youjun
    Chen, Xiaohui
    Gao, Kaizhou
    Li, Yinghe
    Zhang, Lin
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2023, 53 (05) : 3101 - 3113
  • [5] Single CNC machine scheduling with controllable processing times and multiple due dates
    Atan, Mehmet Oguz
    Akturk, M. Selim
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2008, 46 (21) : 6087 - 6111
  • [6] A tabu search algorithm for the single machine total weighted tardiness problem
    Bilge, Umit
    Kurtulan, Mujde
    Kirac, Furkan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 176 (03) : 1423 - 1435
  • [7] Block approach - tabu search algorithm for single machine total weighted tardiness problern
    Bozejko, Wojciech
    Grabowski, Jozef
    Wodecki, Mieczyslaw
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2006, 50 (1-2) : 1 - 14
  • [8] A tabu search algorithm for order acceptance and scheduling
    Cesaret, Bahriye
    Oguz, Ceyda
    Salman, F. Sibel
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (06) : 1197 - 1205
  • [9] Hybrid evolutionary approaches for the single machine order acceptance and scheduling problem
    Chaurasia, Sachchida Nand
    Singh, Alok
    [J]. APPLIED SOFT COMPUTING, 2017, 52 : 725 - 747
  • [10] Real-time order acceptance and scheduling for data-enabled permutation flow shops: Bilevel interactive optimization with nonlinear integer programming
    Chen, Wenchong
    Gong, Xuejian
    Rahman, Humyun Fuad
    Liu, Hongwei
    Qi, Ershi
    [J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2021, 105