论文信息 - Local search procedures for job-shop problems with identical transport robots

Local search procedures for job-shop problems with identical transport robots

We consider a job-shop problem, where jobs have to be transported between machines by identical robots. Thus, in addition to the job data the number of robots and the transportation times between machines are given. We propose two different tabu search approaches to get good solutions in order to minimize the makespan.

Peter U. Brucker | Christian Strotmann

[1] Mauro Dell'Amico,et al. Shop Problems With Two Machines and Time Lags , 1996, Oper. Res..

[2] Vitaly A. Strusevich,et al. A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times , 1999, Discret. Appl. Math..

[3] D. Atkin. OR scheduling algorithms. , 2000, Anesthesiology.

[4] Peter Brucker,et al. A Branch & Bound Algorithm for the Open-shop Problem , 1997, Discret. Appl. Math..

[5] Christophe Picouleau. New Complexity Results on Scheduling with Small Communication Delays , 1995, Discret. Appl. Math..

[6] Thom J. Hodgson,et al. ROBOT TASK SCHEDULING IN A FLEXIBLE MANUFACTURING CELL , 1993 .

[7] Evripidis Bampis,et al. On the complexity of scheduling with large communication delays , 1996 .

[8] Philippe Chrétienne. Task scheduling with interprocessor communication delays , 1992 .

[9] B. J. Lageweg,et al. Multiprocessor scheduling with communication delays , 1990, Parallel Comput..