Improving local search for the fuzzy job shop using a lower bound
Fecha de publicación:
Editorial:
Springer
Versión del editor:
Citación:
Serie:
Lecture Notes in Computer Science ;5988
Descripción física:
Resumen:
We consider the fuzzy job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan. A recent local search method from the literature has proved to be very competitive when used in combination with a genetic algorithm, but at the expense of a high computational cost. Our aim is to improve its efficiency with an alternative rescheduling algorithm and a makespan lower bound to prune non-improving neighbours. The experimental results illustrate the success of our proposals in reducing both CPU time and number of evaluated neighbours
We consider the fuzzy job shop problem, where uncertain durations are modelled as fuzzy numbers and the objective is to minimise the expected makespan. A recent local search method from the literature has proved to be very competitive when used in combination with a genetic algorithm, but at the expense of a high computational cost. Our aim is to improve its efficiency with an alternative rescheduling algorithm and a makespan lower bound to prune non-improving neighbours. The experimental results illustrate the success of our proposals in reducing both CPU time and number of evaluated neighbours
Descripción:
Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2009 (13th. 2009. Sevilla, España)
ISSN:
Identificador local:
20101026
Patrocinado por:
This work supported by MEC-FEDER Grants TIN2007- 67466-C02-01 and MTM2007-62799
Colecciones
- Capítulos de libros [6037]
- Informática [766]
- Investigaciones y Documentos OpenAIRE [7750]
Ficheros en el ítem
![Thumbnail](/dspace/bitstream/handle/10651/9473/Puente2010_postprint.pdf.jpg?sequence=4&isAllowed=y)