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

DOI10.1057/PALGRAVE.JORS.2602099zbMATH Open1152.90447OpenAlexW2065891797MaRDI QIDQ5292811FDOQ5292811

Isa Nakhai Kamalabadi

Publication date: 25 June 2007

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

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

Recommendations

• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• On Minimizing the Expected Makespan and Flow Time in Stochastic Flow Shops with Blocking
• scientific article
• Complexity of flowshop scheduling problems with a new blocking constraint
• A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness
• Makespan preserving flowshop reengineering via blocking constraints
• Improved bounded dynamic programming algorithm for solving the blocking flow shop problem

zbMATH Keywords

production scheduling

Mathematics Subject Classification ID

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

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

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