A simple optimised search heuristic for the job-shop scheduling problem
| Contribuinte(s) |
Universitat Pompeu Fabra. Departament d'Economia i Empresa |
|---|---|
| Data(s) |
12/12/2007
|
| Resumo |
This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times. |
| Identificador | |
| Idioma(s) |
eng |
| Direitos |
L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a> |
| Palavras-Chave | #Statistics, Econometrics and Quantitative Methods #job-shop scheduling #hybrid metaheuristic #optimised search heuristics #grasp #exact methods |
| Tipo |
info:eu-repo/semantics/workingPaper |
