Optimal planning of part's machining on a number of machines
From MaRDI portal
Publication:2545276
zbMath0214.18704MaRDI QIDQ2545276
Publication date: 1969
Published in: Automation and Remote Control (Search for Journal in Brave)
Related Items (10)
Constraint guided accelerated search for mixed blocking permutation flowshop scheduling ⋮ Scheduling a two-machine robotic cell: A solvable case ⋮ Optimizing blocking flow shop scheduling problem with total completion time criterion ⋮ Two-machine flow shop scheduling problem with blocking, multi-task flexibility of the first machine, and preemption ⋮ Scheduling blocking flowshops with setup times via constraint guided and accelerated local search ⋮ A three-phase algorithm for flowshop scheduling with blocking to minimize makespan ⋮ An optimization-based heuristic for the robotic cell problem ⋮ Makespan preserving flowshop reengineering via blocking constraints ⋮ The complexity of scheduling jobs in repetitive manufacturing systems ⋮ 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
