A tabu search algorithm for scheduling a single robot in a job-shop environment
From MaRDI portal
Publication:1602712
DOI10.1016/S0166-218X(01)00273-6zbMath0996.90044MaRDI QIDQ1602712
Sigrid Knust, Johann L. Hurink
Publication date: 24 June 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
single-machine schedulingtabu searchtime windowslocal search algorithmrobot schedulinggeneralization of the traveling salesman problem
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (9)
A scheduling problem in blocking hybrid flow shop robotic cells with multiple robots ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources ⋮ Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots ⋮ A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles ⋮ A general model for cyclic machine scheduling problems ⋮ A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times ⋮ Tabu search algorithms for job-shop problems with a single transport robot ⋮ An optimization-based heuristic for the robotic cell problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A block approach for single-machine scheduling with release dates and due dates
- A fast tabu search algorithm for the permutation flow-shop problem
- A branch and bound algorithm for the job-shop scheduling problem
- Applying tabu search to the job-shop scheduling problem
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
This page was built for publication: A tabu search algorithm for scheduling a single robot in a job-shop environment