A bi-criterion sequence-dependent scheduling problem with order deliveries
| Autor: | Jian-You Xu, Win-Chin Lin, Kai-Xiang Hu, Yu-Wei Chang, Wen-Hsiang Wu, Peng-Hsiang Hsu, Tsung-Hsien Wu, Chin-Chia Wu |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2024 |
| Předmět: | |
| Zdroj: | PeerJ Computer Science, Vol 10, p e1763 (2024) |
| Druh dokumentu: | article |
| ISSN: | 2376-5992 34374264 |
| DOI: | 10.7717/peerj-cs.1763 |
| Popis: | The manufacturing sector faces unprecedented challenges, including intense competition, a surge in product varieties, heightened customization demands, and shorter product life cycles. These challenges underscore the critical need to optimize manufacturing systems. Among the most enduring and complex challenges within this domain is production scheduling. In practical scenarios, setup time is whenever a machine transitions from processing one product to another. Job scheduling with setup times or associated costs has garnered significant attention in both manufacturing and service environments, prompting extensive research efforts. While previous studies on customer order scheduling primarily focused on orders or jobs to be processed across multiple machines, they often overlooked the crucial factor of setup time. This study addresses a sequence-dependent bi-criterion scheduling problem, incorporating order delivery considerations. The primary objective is to minimize the linear combination of the makespan and the sum of weighted completion times of each order. To tackle this intricate challenge, we propose pertinent dominance rules and a lower bound, which are integral components of a branch-and-bound methodology employed to obtain an exact solution. Additionally, we introduce a heuristic approach tailored to the problem’s unique characteristics, along with three refined variants designed to yield high-quality approximate solutions. Subsequently, these three refined approaches serve as seeds to generate three distinct populations or chromosomes, each independently employed in a genetic algorithm to yield a robust approximate solution. Ultimately, we meticulously assess the efficacy of each proposed algorithm through comprehensive simulation trials. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|