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

DOI10.1016/j.ejor.2003.10.034zbMath1132.90324OpenAlexW2217249799MaRDI 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 searchSchedulingTransportationJob-shop problemRobot

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ A simulated multi-objective model for flexible job shop transportation scheduling ⋮ Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm ⋮ Scheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchen ⋮ Flexible job-shop scheduling with transportation resources ⋮ 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 simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints ⋮ The job shop scheduling problem with convex costs ⋮ A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times ⋮ Joint production and transportation scheduling in flexible manufacturing systems ⋮ Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm ⋮ The blocking job shop with rail-bound transportation

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

This page was built for publication: Tabu search algorithms for job-shop problems with a single transport robot