Permutation Schedules for Flow Shops with Precedence Constraints

DOI10.1287/OPRE.38.6.1135MaRDI QIDQ5202022zbMATH OpenOpenAlexFDO

Authors Kevin Ewacha, Ivan Rival, George Steiner

Publication date 1990

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.38.6.1135

zbMATH Keywords

m-machine flow shoppermutation schedulesprecedence constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Permutation vs. non-permutation flow shop schedules
• Permutation schedules for a two-machine flow shop with storage
• The two-machine permutation flow shop with state-dependent processing times
• Flow-shops with a dominant machine
• Two-machine flow shops with an optimal permutation schedule under a storage constraint

Cited in

(12)

• Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
• Permutation vs. non-permutation flow shop schedules
• Reduction of job-shop problems to flow-shop problems with precedence constraints
• Permutation schedules for a two-machine flow shop with storage
• Obituary: Ivan Rival
• Permutation flow shop scheduling with earliness and tardiness penalties
• Certain exact and approximate algorithms for solving precedence problems with constraints
• A note on scheduling jobs with missing operations in permutation flow shops
• scientific article; zbMATH DE number 1054688 (Why is no real title available?)
• scientific article; zbMATH DE number 2156294 (Why is no real title available?)
• The connection between the bump number problem and flow-shop scheduling with precedence constraints
• Makespan distribution of permutation flowshop schedules

This page was built for publication: Permutation Schedules for Flow Shops with Precedence Constraints

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