A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking

DOI10.1007/s10479-005-2444-3zbMath1091.90075OpenAlexW2021347904MaRDI QIDQ817122

Débora P. Ronconi

Publication date: 7 March 2006

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-005-2444-3

zbMATH Keywords

branch-and-boundmakespanlower boundflowshopblocking

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (18)

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ Clustered enhanced differential evolution for the blocking flow shop scheduling problem ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A comparative study on three graph-based constructive algorithms for multi-stage scheduling with blocking ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem ⋮ A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion ⋮ Surgical case scheduling as a generalized job shop scheduling problem ⋮ An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers ⋮ An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers ⋮ Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers ⋮ Mixed integer linear programming models for flow shop scheduling with a demand plan of job types ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems ⋮ An optimization-based heuristic for the robotic cell problem

Cites Work

• Unnamed Item
• Sequencing of jobs in some production system
• The permutation flow shop with buffers: A tabu search approach
• Benchmarks for basic scheduling problems
• Optimal planning of part's machining on a number of machines
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Flowshop sequencing problems with limited buffer storage
• Flowshop scheduling with limited temporary storage
• Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage
• Note—Sequencing with Finite Intermediate Storage
• Formulations and heuristics for scheduling in a buffer-constrained flowshop and flowline-based manufacturing cell with different buffer-space requirements for jobs: Part 1
• Minimizing Cycle Time in a Blocking Flowshop
• Lower bounding schemes for flowshops with blocking in-process
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• On the Flow-Shop Sequencing Problem with No Wait in Process^†
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

This page was built for publication: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking