The impact of missing operations on the flow shop: permutation \textit{vs}. non permutation modes

DOI10.1051/RO/2025032MaRDI QIDQ6978057zbMATH OpenFDO

Authors Randa Ouchene, Djamal Rebaine, Pierre Baptiste

Publication date 28 May 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2025032

zbMATH Keywords

flow shopmakespanmissing operationsno-waitpermutationtotal completion time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Mixed integer programming (90C11)

Cites work

• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• A computational study of the permutation flow shop problem based on a tight lower bound
• A note on scheduling jobs with missing operations in permutation flow shops
• Complexity of Scheduling Shops with No Wait in Process
• Effective heuristics for permutation and non-permutation flow shop scheduling with missing operations
• Fast heuristics for minimizing the makespan in non-permutation flow shops
• scientific article; zbMATH DE number 5345854 (Why is no real title available?)
• scientific article; zbMATH DE number 3754389 (Why is no real title available?)
• Optimal two- and three-stage production schedules with set-up time included
• Permutation vs. non-permutation flow shop schedules
• The Complexity of Flowshop and Jobshop Scheduling
• Two-machine no-wait flow shop scheduling with missing operations

This page was built for publication: The impact of missing operations on the flow shop: permutation \textit{vs}. non permutation modes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6978057)