A new algorithm for minimizing makespan, Cmax, in blocking flow-shop problem through slowing down the operations

DOI10.1057/PALGRAVE.JORS.2602099zbMath1152.90447OpenAlexW2065891797MaRDI QIDQ5292811

Isa Nakhai Kamalabadi

Publication date: 25 June 2007

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.2602099

zbMATH Keywords

production scheduling

Mathematics Subject Classification ID

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

This page was built for publication: A new algorithm for minimizing makespan, C_max, in blocking flow-shop problem through slowing down the operations