Lower bounding schemes for flowshops with blocking in-process
From MaRDI portal
Recommendations
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion
- scientific article; zbMATH DE number 4076953
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- Complexity of flowshop scheduling problems with a new blocking constraint
Cited in
(13)- A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
- An optimization-based heuristic for the robotic cell problem
- Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
- 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 variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Makespan preserving flowshop reengineering via blocking constraints
- A review of TSP based approaches for flowshop scheduling
- Scheduling manufacturing systems with blocking: a Petri net approach
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems
This page was built for publication: Lower bounding schemes for flowshops with blocking in-process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4658520)
