The flexible blocking job shop with transfer and set-up times

DOI10.1007/s10878-009-9278-xzbMath1226.90036OpenAlexW2011141865MaRDI QIDQ719021

Reinhard Bürgy, Dinh Nguyen Pham, Heinz Groeflin

Publication date: 27 September 2011

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-009-9278-x

zbMATH Keywords

tabu searchjob shop schedulingblockingdisjunctive graphsetupflexible machines

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem ⋮ An integrated approach for scheduling health care activities in a hospital ⋮ A flexible job shop scheduling approach with operators for coal export terminals ⋮ Flexible job shop scheduling with blockages ⋮ Efficient primal heuristic updates for the blocking job shop problem ⋮ The job shop scheduling problem with convex costs ⋮ The blocking job shop with rail-bound transportation

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• A rollout metaheuristic for job shop scheduling problems
• Job-shop scheduling with limited capacity buffers
• Feasible insertions in job shop scheduling, short cycles and stable sets
• Cyclic job shop scheduling problems with blocking
• A new neighborhood and tabu search for the blocking job shop
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• Job-shop scheduling with blocking and no-wait constraints
• A Fast Taboo Search Algorithm for the Job Shop Problem