Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems

DOI10.1016/j.cor.2005.05.018zbMath1107.90016OpenAlexW1843322475MaRDI QIDQ856670

Ramon Companys, Manel Mateo

Publication date: 7 December 2006

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.05.018

zbMATH Keywords

schedulingpermutation flow-shopblocking flow-shopdouble branch-and-bound algorithm

Mathematics Subject Classification ID

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

Related Items (11)

Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking ⋮ 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 ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem ⋮ On some lower bounds for the permutation flowshop problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ Improved bounded dynamic programming algorithm for solving the blocking flow shop problem ⋮ Flow shop scheduling with heterogeneous workers ⋮ Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues ⋮ An empirical analysis of the optimality rate of flow shop heuristics

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive branching rule for the permutation flow-shop problem
• Two branch and bound algorithms for the permutation flow shop problem
• A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
• Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
• A computational study of the permutation flow shop problem based on a tight lower bound
• Benchmarks for basic scheduling problems
• Optimal two- and three-stage production schedules with setup times included
• Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
• Minimising Maximum Lateness in a Two-Machine Flowshop
• Flowshop sequencing problems with limited buffer storage
• Flowshop scheduling with limited temporary storage
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• An Evaluation of Flow Shop Sequencing Heuristics
• The Complexity of Flowshop and Jobshop Scheduling
• A high quality solution constructive heuristic for flow shop sequencing
• Lower bounding schemes for flowshops with blocking in-process
• A branch-and-bound-based local search method for the flow shop problem
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
• A Functional Heuristic Algorithm for the Flowshop Scheduling 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: Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems