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

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@Article{SHI:2021:COR,

• author = "Zhongshun Shi and Hang Ma and Meiheng Ren and Tao Wu and Andrew J. Yu",
• title = "A learning-based two-stage optimization method for customer order scheduling",
• journal = "Computer \& Operations Research",
• volume = "136",
• pages = "105488",
• year = "2021",
• ISSN = "0305-0548",
• DOI = "doi:10.1016/j.cor.2021.105488",
• URL = "https://www.sciencedirect.com/science/article/pii/S0305054821002355",
• keywords = "genetic algorithms, genetic programming, Customer order scheduling, Artificial intelligence, Dispatching rules, Heuristics",
• abstract = "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 off-line 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",

}

Genetic Programming entries for Tony Zhongshun Shi Hang Ma Meiheng Ren Tao Wu Andrew J Yu

Citations