TL;DR
Experimental results indicate that IMOSMA consistently outperforms the comparative algorithms on the majority of test instances, highlighting its effectiveness and stable performance on the tested distributed assembly scheduling instances.
The hybrid flow shop scheduling problem (HFSP) with unrelated parallel machines (UPMs), sequence-dependent setup times (SDSTs), and inter-stage transportation times has recently emerged as a prominent research topic. To address this scheduling problem with the objective of minimizing the maximum completion time (makesp...
This paper investigates the energy-efficient hybrid flow shop scheduling problem considering deteriorating maintenance and transportation times (EHFSP-DMT), which is an NP-hard combinatorial optimization problem in complex manufacturing systems. To formulate this problem, a mixed-integer programming mathematical model...
The dynamic scheduling of ready-mixed concrete constitutes a critical bottleneck in construction automation. Following the design science paradigm and informed by a systematic literature review, this study develops the multistrategy ant colony optimization (MSACO) algorithm, which integrates three mechanisms: adapt...
Experimental results show that the improved algorithm achieves an optimal Makespan value of 190 in dynamic disturbance scenarios and exhibits strong robustness, providing an efficient and feasible solution for job shop scheduling in complex production environments.
: The hybrid flow shop scheduling problem (HFSP) is a widely used model for energy-efficient multi-stage manufacturing, yet semiconductor studies rarely combine discrete assembly and packaging, batch burn-in processing and speed-adjustable testing within a single four-stage formulation. Most also treat energy consumpti...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
