Clustered flow shop models

DOI10.1007/BF00121678zbMath0866.90078OpenAlexW2049716821MaRDI QIDQ2564881

Wlodzimierz Szwarc

Publication date: 7 January 1997

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00121678

zbMATH Keywords

approximate solutionsclustersflow-shop modelsnew lower bounds

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal two- and three-stage production schedules with setup times included
• Permutation flow-shop theory revisited
• Flow Shop Problems with Time Lags
• The clustered flow-shop problem
• ON EQUIVALENT-JOB FOR JOB-BLOCK IN 2×n SEQUENCING PROBLEM WITH TRANSPORTATION-TIMES
• TWO-MACHINE SCHEDULING UNDER REQUIRED PRECEDENCE AMONG JOBS
• THREE-MACHINE SCHEDULING PROBLEM WITH PRECEDENCE CONSTRAINTS
• TWO-MACHINE SCHEDULING UNDER ARBITRARY PRECEDENCE CONSTRAINTS
• Special cases of the flow-shop problem

This page was built for publication: Clustered flow shop models