Permutation flow-shop theory revisited

DOI10.1002/NAV.3800250315zbMATH Open0413.90030OpenAlexW2025588823MaRDI QIDQ3048554FDOQ3048554

Wlodzimierz Szwarc

Publication date: 1978

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800250315

zbMATH Keywords

schedulingflow-shop problempermutation flow-shop theory

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Deterministic scheduling theory in operations research (90B35) Discrete mathematics in relation to computer science (68R99)

Cites Work

• Technical Note—Precedence Relations of the Flow-Shop Problem

Cited In (5)

• Clustered flow shop models
• Minimizing Mean Completion Time for Special Flowshop Problems
• Generating improved dominance conditions for the flowshop problem
• Applications of max-plus algebra to flow shop scheduling problems
• The clustered flow-shop problem

This page was built for publication: Permutation flow-shop theory revisited

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