Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

DOI10.1504/IJMOR.2017.080743MaRDI QIDQ2204271zbMATH OpenFDO

Authors Bassem Jarboui, Mansour Eddaly, Abdelwaheb Rebaï, Said Toumi

Publication date 15 October 2020

Published in International Journal of Mathematics in Operational Research (Search for Journal in Brave)

zbMATH Keywords

branch-and-bound algorithmlower boundflowshop schedulingmakespanpermutation flowshopsblocking constraints

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)

Recommendations

• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• A new lower bounding rule for permutation flow shop scheduling
• A computational study of the permutation flow shop problem based on a tight lower bound
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• A new branch-and-bound approach for the \(n/2\)/flowshop/\(\alpha F+\beta C_{\text{max}}\) flowshop scheduling problem

Cited in

(14)

• Makespan preserving flowshop reengineering via blocking constraints
• scientific article; zbMATH DE number 5525237 (Why is no real title available?)
• Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• A new lower bounding rule for permutation flow shop scheduling
• Flowshop-scheduling problems with makespan criterion: a review
• Lower bounding schemes for flowshops with blocking in-process
• Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates
• A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
• A new algorithm for minimizing makespan, C_max, in blocking flow-shop problem through slowing down the operations
• Optimizing blocking flow shop scheduling problem with total completion time criterion
• A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
• A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking
• A variable block insertion heuristic for solving permutation flow shop scheduling problem with makespan criterion

This page was built for publication: Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

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