A tabu search algorithm for scheduling a single robot in a job-shop environment

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)

zbMATH Keywords

single-machine scheduling; tabu search; time windows; local search algorithm; robot scheduling; generalization of the traveling salesman problem

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Tabu search algorithms for job-shop problems with a single transport robot, A general model for cyclic machine scheduling problems, An optimization-based heuristic for the robotic cell problem, A simple metaheuristic approach to the simultaneous scheduling of machines and automated guided vehicles

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