Next Article in Journal
Existence, Uniqueness and Stability Analysis with the Multiple Exp Function Method for NPDEs
Previous Article in Journal
Multibranch Attention Mechanism Based on Channel and Spatial Attention Fusion
Previous Article in Special Issue
Optimal Emergency Evacuation Route Planning Model Based on Fire Prediction Data
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment

1
Department of Computer Science and Information Engineering, Cheng Shiu University, Kaohsiung City 83347, Taiwan
2
College of Information Science and Engineering, Northeastern University, Shenyang 110819, China
3
Department of E-Sport Technology Management, Cheng Shiu University, Kaohsiung City 83347, Taiwan
4
Key Lab for OCME, School of Mathematical Science, Chongqing Normal University, Chongqing 401331, China
5
Department of Statistics, Feng Chia University, Taichung 40724, Taiwan
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(21), 4146; https://doi.org/10.3390/math10214146
Submission received: 4 October 2022 / Revised: 23 October 2022 / Accepted: 2 November 2022 / Published: 6 November 2022
(This article belongs to the Special Issue Combinatorial Optimization Problems in Planning and Decision Making)

Abstract

Studies on the customer order scheduling problem have been attracting increasing attention. Most current approaches consider that either component processing times for customer orders on each machine are constant or all customer orders are available at the outset of production planning. However, these assumptions do not hold in real-world applications. Uncertainty may be caused by multiple issues including a machine breakdown, the working environment changing, and workers’ instability. On the basis of these factors, we introduced a parallel-machine customer order scheduling problem with two scenario-dependent component processing times, due dates, and ready times. The objective was to identify an appropriate and robust schedule for minimizing the maximum of the sum of weighted numbers of tardy orders among the considered scenarios. To solve this difficult problem, we derived a few dominant properties and a lower bound for determining an optimal solution. Subsequently, we considered three variants of Moore’s algorithm, a genetic algorithm, and a genetic-algorithm-based hyper-heuristic that incorporated the proposed seven low-level heuristics to solve this problem. Finally, the performances of all proposed algorithms were evaluated.
Keywords: order scheduling; scenario-dependent; genetic algorithm; genetic hyper-heuristic; low-level heuristics order scheduling; scenario-dependent; genetic algorithm; genetic hyper-heuristic; low-level heuristics

Share and Cite

MDPI and ACS Style

Li, L.-Y.; Xu, J.-Y.; Cheng, S.-R.; Zhang, X.; Lin, W.-C.; Lin, J.-C.; Wu, Z.-L.; Wu, C.-C. A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment. Mathematics 2022, 10, 4146. https://doi.org/10.3390/math10214146

AMA Style

Li L-Y, Xu J-Y, Cheng S-R, Zhang X, Lin W-C, Lin J-C, Wu Z-L, Wu C-C. A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment. Mathematics. 2022; 10(21):4146. https://doi.org/10.3390/math10214146

Chicago/Turabian Style

Li, Lung-Yu, Jian-You Xu, Shuenn-Ren Cheng, Xingong Zhang, Win-Chin Lin, Jia-Cheng Lin, Zong-Lin Wu, and Chin-Chia Wu. 2022. "A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment" Mathematics 10, no. 21: 4146. https://doi.org/10.3390/math10214146

APA Style

Li, L.-Y., Xu, J.-Y., Cheng, S.-R., Zhang, X., Lin, W.-C., Lin, J.-C., Wu, Z.-L., & Wu, C.-C. (2022). A Genetic Hyper-Heuristic for an Order Scheduling Problem with Two Scenario-Dependent Parameters in a Parallel-Machine Environment. Mathematics, 10(21), 4146. https://doi.org/10.3390/math10214146

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop