An in-depth analysis of job sequencing in flow-shop scheduling problems, with a focus on exploring alternative mean-based techniques alongside the classical Johnson’s method, highlights that mean based methods can serve as viable alternatives to Johnson’s method, offering flexibility in sequencing decisions while retaining solution quality.
This paper presents an in-depth analysis of job sequencing in flow-shop scheduling problems, with a focus on exploring alternative mean-based techniques alongside the classical Johnson’s method. While Johnson’s method is widely recognized for determining optimal job sequences in two and three machine problems, this stu...
M. Asadujjaman, Esrat Jahan Meem, Isnat Jahan Owishi· Dhaka University Journal of...· 1 citation
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.
Jianguo Du, Chengkun Li, Zijie Tang· ITM Web of Conferences· 0 citations
This work establishes a polynomial equivalence between JSC and a variant of the resource-constrained job shop problem with unit-capacity resources and proposes a genetic algorithm using permutation-with-repetition encoding and active, non-delay, and hybrid schedule evaluation procedures.
The findings demonstrate how mathematical optimization and advanced metaheuristics can be combined with problem-specific structural insights to improve solution quality and computational efficiency in production and operations research.
This work proposes an exact algorithm for the SSP, namely the Combinatorial Branch-and-Bound (C-B\&B) algorithm, which combines two distinct branch-and-bound algorithms, each introducing novel features compared with the existing literature.
Alberto Locatelli, Jean-François Côté, Leandro C. Coelho· 0 citations
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...
