Different behaviour of a double branch-and-bound algorithm on Fm|prmu|C_ and Fm| block|C_ problems
From MaRDI portal
Publication:856670
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
Cites work
- scientific article; zbMATH DE number 4027206 (Why is no real title available?)
- scientific article; zbMATH DE number 44978 (Why is no real title available?)
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A General Bounding Scheme for the Permutation Flow-Shop 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
- A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
- A branch-and-bound-based local search method for the flow shop problem
- A computational study of the permutation flow shop problem based on a tight lower bound
- A high quality solution constructive heuristic for flow shop sequencing
- An Evaluation of Flow Shop Sequencing Heuristics
- An adaptive branching rule for the permutation flow-shop problem
- Benchmarks for basic scheduling problems
- Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines
- Flowshop scheduling with limited temporary storage
- Flowshop sequencing problems with limited buffer storage
- Lower bounding schemes for flowshops with blocking in-process
- Minimising Maximum Lateness in a Two-Machine Flowshop
- Note on an improved branch-and-bound algorithm to solve \(n/m/P/F_{\text{max}}\) problems
- On the Flow-Shop Sequencing Problem with No Wait in Process†
- Optimal two- and three-stage production schedules with set-up time included
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Sequencing in an Assembly Line with Blocking to Minimize Cycle Time
- The Complexity of Flowshop and Jobshop Scheduling
- Two branch and bound algorithms for the permutation flow shop problem
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 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
- A review and classification on distributed permutation flowshop scheduling problems
- 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)
