A computationally effective heuristic method for solving the minimum makespan problem of job shop scheduling is presented. The proposed local search method is based on a tabu search technique and on the shifting bottleneck procedure used to generate the initial solution and to refine the next-current solutions. Computational experiments on a standard set of problem instances show that, in several cases, our approach, in a reasonable amount of computer time, yields better results than the other heuristic procedures discussed in the literature.
E. Merelli, F. Pezzella. A tabu search method guided by a shifting bottleneck for a job shop scheduling. European Journal of Operational Research, volume 120, pagine 297-310, 2000 / Merelli, Emanuela; Pezzella, F.. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 120:2(2000), pp. 297-310.
Scheda prodotto non validato
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo
Titolo: | E. Merelli, F. Pezzella. A tabu search method guided by a shifting bottleneck for a job shop scheduling. European Journal of Operational Research, volume 120, pagine 297-310, 2000 |
Autori: | |
Data di pubblicazione: | 2000 |
Rivista: | |
Citazione: | E. Merelli, F. Pezzella. A tabu search method guided by a shifting bottleneck for a job shop scheduling. European Journal of Operational Research, volume 120, pagine 297-310, 2000 / Merelli, Emanuela; Pezzella, F.. - In: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH. - ISSN 0377-2217. - STAMPA. - 120:2(2000), pp. 297-310. |
Handle: | http://hdl.handle.net/11581/6599 |
Appare nelle tipologie: | Articolo |