Different behaviour of a double branch-and-bound algorithm on Fm|prmu|C_ and Fm| block|C_ problems
DOI10.1016/J.COR.2005.05.018zbMATH Open1107.90016OpenAlexW1843322475MaRDI QIDQ856670FDOQ856670
Authors: 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
Recommendations
- Two branch and bound algorithms for the permutation flow shop problem
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- A bicriteria two-machine permutation flowshop problem
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- scientific article; zbMATH DE number 495274
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Cites Work
- Optimal two- and three-stage production schedules with set-up time included
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Flowshop and Jobshop Scheduling
- A computational study of the permutation flow shop problem based on a tight lower bound
- Benchmarks for basic scheduling problems
- 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
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- An Evaluation of Flow Shop Sequencing Heuristics
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- Flowshop sequencing problems with limited buffer storage
- 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
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- Two branch and bound algorithms for the permutation flow shop problem
- Flowshop scheduling with limited temporary storage
- An adaptive branching rule 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
- Minimising Maximum Lateness in a Two-Machine Flowshop
Cited In (11)
- On some lower bounds for the permutation flowshop problem
- Improved bounded dynamic programming algorithm for solving the blocking flow shop problem
- A review and classification on distributed permutation flowshop scheduling problems
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- 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
- An empirical analysis of the optimality rate of flow shop heuristics
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Flow shop scheduling with heterogeneous workers
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856670)
