Review
A comprehensive literature review for hybrid flow shop scheduling problems with dedicated machines
Computer Science
Similar papers
Open access
Novel solution algorithms for machine scheduling problems emerging in complex systems
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.
Söhnke Maecker
· 0 citations
Open access
Aug 2026
An Adaptive Co-Evolutionary Memetic Algorithm for a Hybrid Flow Shop Scheduling Problem with Sequence-Dependent Setup and Transportation Times
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...
De-Kun Wang, Yue-Chang Lei, Zheng Yuan et al.
· Machines · 0 citations
Preprint
Sep 2026
Minimizing the makespan in job shop scheduling under conflict graph constraints
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.
Nour ElHouda Tellache, Abdenour Azerine
· 0 citations
Preprint
Aug 2026
New Complexity Results for Fair Repetitive Scheduling
This paper revisits the problem of finding fair solutions to repetitive scheduling problems with a single machine and resolves three questions and identifies several additional directions for future research.
Moran Koren, Michael L. Pinedo, D. Shabtay
· 0 citations
Review
Open access
Sep 2026
Protocol: Systematic Literature Review on Multiproduct Lotsizing and Scheduling in Single-Machine Environments: A Theoretical-Empirical Analysis
Multiproduct lot-sizing and scheduling in single-machine or single-resource environments constitutes a classical and still relevant problem in the field of operations management. It requires coordinating lot-size decisions, production scheduling or sequencing, and the use of a constrained production resource, under set...
F. Jones, P. I. Vidal-Carreras
· WPOM : Working Papers on Ope... · 1 citation
A Proposed Heuristic Algorithm for 𝒏𝒏 -job 𝒎𝒎 -machine Job Sequencing Problem
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 retai...
Md. Asadujjaman Esrat Jahan Meem, Isnat Jahan Owishi
· 0 citations