Optimal planning of part's machining on a number of machines
From MaRDI portal
Publication:2545276
Cited in
(11)- An optimization-based heuristic for the robotic cell problem
- The complexity of scheduling jobs in repetitive manufacturing systems
- Constraint guided accelerated search for mixed blocking permutation flowshop scheduling
- Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption
- A three-phase algorithm for flowshop scheduling with blocking to minimize makespan
- Scheduling a two-machine robotic cell: A solvable case
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search
- Makespan preserving flowshop reengineering via blocking constraints
- Optimizing blocking flow shop scheduling problem with total completion time criterion
- A hybrid population-based ruin-and-recreate algorithm for the blocking flow shop scheduling problem
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
This page was built for publication: Optimal planning of part's machining on a number of machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545276)
