A learning-based two-stage optimization method for customer order scheduling

被引:7
作者
Shi, Zhongshun [1 ]
Ma, Hang [1 ]
Ren, Meiheng [1 ]
Wu, Tao [2 ]
Yu, Andrew J. [1 ]
机构
[1] Univ Tennessee, Dept Ind & Syst Engn, Knoxville, TN 37996 USA
[2] Dow, Adv Analyt Dept, Midland, MI 48642 USA
关键词
Customer order scheduling; Artificial intelligence; Dispatching rules; Genetic programming; Heuristics; MULTIPLE PRODUCT TYPES; TOTAL COMPLETION-TIME; ENVIRONMENT; HEURISTICS; ALGORITHMS; MACHINES; SYSTEM;
D O I
10.1016/j.cor.2021.105488
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper addresses the customer order scheduling problem in parallel production environment commonly appearing in the pharmaceutical and paper industries. The problem aims to minimize the total completion time of the orders with their jobs processed on dedicated machines in parallel. To deal with the computational challenge of large-scale problems, we propose a learning-based two-stage optimization method consisting of a learned dispatching rule in the first stage and an adaptive local search in the second stage. The new dispatching rules are automatically generated by the proposed feature-enhanced genetic programming method in an offline learning manner. Based on the high-quality initial solutions provided by the learned dispatching rule, we develop an adaptive local search to further improve the solution quality. Numerical results indicate the superiority of the learned dispatching rule and show the proposed two-stage optimization method significantly outperforms state-of-the-art methods in the literature.
引用
收藏
页数:18
相关论文
共 51 条
[1]  
Blocher JD, 1996, NAV RES LOG, V43, P629, DOI 10.1002/(SICI)1520-6750(199608)43:5<629::AID-NAV3>3.0.CO
[2]  
2-7
[3]   Automated Design of Production Scheduling Heuristics: A Review [J].
Branke, Juergen ;
Su Nguyen ;
Pickardt, Christoph W. ;
Zhang, Mengjie .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (01) :110-124
[4]   Hyper-heuristic Evolution of Dispatching Rules: A Comparison of Rule Representations [J].
Branke, Juergen ;
Hildebrandt, Torsten ;
Scholz-Reiter, Bernd .
EVOLUTIONARY COMPUTATION, 2015, 23 (02) :249-277
[5]   Hyper-heuristics: a survey of the state of the art [J].
Burke, Edmund K. ;
Gendreau, Michel ;
Hyde, Matthew ;
Kendall, Graham ;
Ochoa, Gabriela ;
Oezcan, Ender ;
Qu, Rong .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2013, 64 (12) :1695-1724
[6]   NSGA-II with Iterated Greedy for a Bi-objective Three-stage Assembly Flowshop Scheduling Problem [J].
Campos, Saulo Cunha ;
Claudio Arroyo, Jose Elias .
GECCO'14: PROCEEDINGS OF THE 2014 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2014, :429-436
[7]   Minimizing maximum delivery completion time for order scheduling with rejection [J].
Chen, Ren-Xia ;
Li, Shi-Sheng .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2020, 40 (04) :1044-1064
[8]   Multi-objective optimization of the order scheduling problem in mail-order pharmacy automation systems [J].
Dauod, Husam ;
Li, Debiao ;
Yoon, Sang Won ;
Srihari, Krishnaswami .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2018, 99 (1-4) :73-83
[9]  
De Athayde Prata B, 2020, COMPUT IND ENG
[10]   High-Dimensional Robust Multi-Objective Optimization for Order Scheduling: A Decision Variable Classification Approach [J].
Du, Wei ;
Zhong, Weimin ;
Tang, Yang ;
Du, Wenli ;
Jin, Yaochu .
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2019, 15 (01) :293-304