Tabu search algorithms for job-shop problems with a single transport robot

DOI10.1016/j.ejor.2003.10.034zbMath1132.90324MaRDI QIDQ707135

Sigrid Knust, Johann L. Hurink

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/tabu-search-algorithms-for-jobshop-problems-with-a-single-transport-robot(1c99cfef-e77d-4d1e-aa19-456006336143).html

zbMATH Keywords

Tabu search; Scheduling; Transportation; Job-shop problem; Robot

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B06: Transportation, logistics and supply chain management

90B35: Deterministic scheduling theory in operations research

Cites Work

• Unnamed Item
• A block approach for single-machine scheduling with release dates and due dates
• The job shop scheduling problem: Conventional and new solution techniques
• A branch and bound algorithm for the job-shop scheduling problem
• Cyclic scheduling in robotic flowshops
• A tabu search algorithm for scheduling a single robot in a job-shop environment
• Deterministic job-shop scheduling: Past, present and future
• A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times
• Job Shop Scheduling by Simulated Annealing
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• 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
• Makespan minimization for flow-shop problems with transportation times and a single robot