The blocking job shop with rail-bound transportation

DOI10.1007/s10878-014-9723-3zbMath1338.90161OpenAlexW2076755780MaRDI QIDQ5963615

Reinhard Bürgy, Heinz Groeflin

Publication date: 23 February 2016

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

Full work available at URL: https://doi.org/10.1007/s10878-014-9723-3

zbMATH Keywords

tabu searchjob shop schedulingblockingdisjunctive graphjob insertionrail-bound transportationrobots

Mathematics Subject Classification ID

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

Related Items (4)

A survey of job shop scheduling problem: the types and models ⋮ A neighborhood for complex job shop scheduling problems with regular objectives ⋮ The job shop scheduling problem with convex costs ⋮ Approximation algorithms for the twin robot scheduling problem

Cites Work

• A branch and bound algorithm for the cyclic job-shop problem with transportation
• Crane scheduling in container yards with inter-crane interference
• Tabu search algorithms for job-shop problems with a single transport robot
• The flexible blocking job shop with transfer and set-up times
• Job-shop scheduling with limited capacity buffers
• Feasible insertions in job shop scheduling, short cycles and stable sets
• A new neighborhood and tabu search for the blocking job shop
• Discrete time model and algorithms for container yard crane scheduling
• On dual minimum cost flow algorithms
• Job-shop scheduling with blocking and no-wait constraints
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• Optimal job insertion in the no-wait job shop
• Integrated production and material handling scheduling using mathematical programming and constraint programming
• Complex Scheduling
• A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• Optimal Cyclic Multi-Hoist Scheduling: A Mixed Integer Programming Approach

This page was built for publication: The blocking job shop with rail-bound transportation