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

DOI10.1016/J.EJOR.2003.10.034MaRDI QIDQ707135zbMATH OpenOpenAlexFDO

Authors 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

Job-shop problemRobotSchedulingTabu searchTransportation

Mathematics Subject Classification ID

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

Recommendations

• A tabu search algorithm for scheduling a single robot in a job-shop environment
• Lower bounds for scheduling a single robot in a job-shop environment
• Tabu-search for the multi-mode job-shop problem
• Tabu search for the job-shop scheduling problem with multi-purpose machines
• scientific article; zbMATH DE number 1374865

Cites work

• A block approach for single-machine scheduling with release dates and due dates
• A branch \& bound method for the general-shop problem with sequence dependent setup-times
• A branch and bound algorithm for the job-shop scheduling problem
• A Fast Taboo Search Algorithm for the Job Shop Problem
• A tabu search algorithm for scheduling a single robot in a job-shop environment
• A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS
• Cyclic scheduling in robotic flowshops
• Deterministic job-shop scheduling: Past, present and future
• scientific article; zbMATH DE number 1374865 (Why is no real title available?)
• Job Shop Scheduling by Simulated Annealing
• Makespan minimization for flow-shop problems with transportation times and a single robot
• ON AN AUTOMATED TWO-MACHINE FLOWSHOP SCHEDULING PROBLEM WITH INFINITE BUFFER
• The job shop scheduling problem: Conventional and new solution techniques

Cited in

(18)

• A tabu search algorithm for scheduling a single robot in a job-shop environment
• Group-shop scheduling with sequence-dependent set-up and transportation times
• 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
• Lower bounds for scheduling a single robot in a job-shop environment
• 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
• Joint production and transportation scheduling in flexible manufacturing systems
• Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm
• Ant colony algorithm for just-in-time job shop scheduling with transportation times and multirobots
• Makespan minimization for flow-shop problems with transportation times and a single robot
• The blocking job shop with rail-bound transportation
• 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
• Scheduling in manufacturing with transportation: classification and solution techniques
• Transportation and delivery in flow-shop scheduling problems: a systematic review

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q707135)