Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop

DOI10.1057/jors.1993.140zbMath0794.90025OpenAlexW1967250968MaRDI QIDQ4273245

Ching-Jong Liao

Publication date: 2 January 1994

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/jors.1993.140

zbMATH Keywords

heuristic solutionflow-shopminimum makespanmachine idle periods

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Bilevel programming applied to the flow shop scheduling problem ⋮ The flow shop problem with no-idle constraints: a review and approximation ⋮ A study of integer programming formulations for scheduling problems

Uses Software

• LINDO

This page was built for publication: Minimizing the Number of Machine Idle Intervals with Minimum Makespan in a Flow-Shop