Minimizing makespan in re-entrant permutation flow-shops

DOI10.1057/PALGRAVE.JORS.2601556zbMath1095.90554OpenAlexW2085011399MaRDI QIDQ4661115

Jason Chao-Hsien Pan, Jen-Shiang Chen

Publication date: 4 April 2005

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

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

zbMATH Keywords

heuristicsschedulingmixed binary integer programmingre-entrant permutation flow-shops

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times ⋮ Minimizing total completion time for re-entrant flow shop scheduling problems ⋮ Heuristic algorithms for two machine re-entrant flow shop ⋮ Minimizing makespan on an \(m\)-machine re-entrant flowshop ⋮ Multi-family scheduling in a two-machine reentrant flow shop with setups ⋮ Re-entrant flowshop scheduling with learning considerations to minimize the makespan ⋮ Flow shops with reentry: reversibility properties and makespan optimal schedules ⋮ An Iterated Local Search for a Re-entrant Flow Shop Scheduling Problem ⋮ Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop ⋮ Minimizing total tardiness on a two-machine re-entrant flowshop

This page was built for publication: Minimizing makespan in re-entrant permutation flow-shops