English español

Repositorio de la Universidad de Oviedo. > Producción Bibliográfica de UniOvi: RECOPILA > Ponencias, Discursos y Conferencias >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10651/34010

Title: Combining global pruning rules with depth-first search for the job shop scheduling problem with operators
Author(s): Mencía Cascallana, Carlos
Sierra Sánchez, María Rita
Salido, Miguel A.
Escamilla, Joan
Varela Arias, José Ramiro
Issue date: Jun-2012
Abstract: We propose an enhanced depth- rst heuristic search algorithm to face the job shop scheduling problem with operators. This problem extends the classical job shop scheduling problem by considering a limited number of human operators that assist the processing of the operations. We considered total ow time minimization as objective function which makes the problem harder to solve and more interesting from a practical point of view than minimizing the makespan. The proposed method exploits a schedule generation scheme termed OG&T, two admissible heuristics and some powerful global pruning rules that require recording expanded states. We have conducted an experimental study across several benchmarks to evaluate our algorithm. The results show that the global pruning method is really e ective and that the proposed approach is quite competent for solving this problem
URI: http://hdl.handle.net/10651/34010
Sponsored: This research has been supported by the Spanish Government under projects MEC-FEDER TIN-20976-C02-01 and TIN-20976-C02-02 and by the Principality of Asturias under grant FICYT-BP09105
Project id.: MEC-FEDER/TIN-20976-C02-01
Appears in Collections:Ponencias, Discursos y Conferencias

Files in This Item:

File Description SizeFormat
Sierra2012_postprint.pdfSierra2012_postprint324,83 kBAdobe PDFView/Open

Exportar a Mendeley

This item is licensed under a Creative Commons License
Creative Commons

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Base de Datos de Autoridades Biblioteca Universitaria Consultas / Sugerencias