The three-machine flow-shop problem with arbitrary precedence relations

DOI10.1016/0377-2217(94)90384-0MaRDI QIDQ1342006zbMATH OpenOpenAlexFDO

Authors Chong John Lim, Graham B. McMahon

Publication date 13 July 1995

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(94)90384-0

zbMATH Keywords

branch and boundflowshopprecedence constraintsseries-parallel

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• The two-machine flow shop problem with arbitrary precedence relations
• scientific article; zbMATH DE number 1054688
• Algorithms for two-machine flow-shop sequencing with precedence constraints
• Flow shop scheduling problems under machine-dependent precedence constraints
• scientific article; zbMATH DE number 1264301

Cites work

• Complexity of Scheduling under Precedence Constraints
• scientific article; zbMATH DE number 3786461 (Why is no real title available?)
• Optimal two- and three-stage production schedules with set-up time included
• Sequencing with Series-Parallel Precedence Constraints
• Some efficient heuristic methods for the flow shop sequencing problem
• The Recognition of Series Parallel Digraphs
• The two-machine flow shop problem with arbitrary precedence relations
• The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions

Cited in

(5)

• The hot strip mill production scheduling problem: A tabu search approach
• Flow shop scheduling problems under machine-dependent precedence constraints
• The two-machine flow shop problem with arbitrary precedence relations
• Exact solution of the two-machine flow shop problem with three operations
• Algorithms for two-machine flow-shop sequencing with precedence constraints

This page was built for publication: The three-machine flow-shop problem with arbitrary precedence relations

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