A simple optimised search heuristic for the job-shop scheduling problem

Susana Fernandes and Helena Ramalhinho-Lourenço ()
Additional contact information
Helena Ramalhinho-Lourenço: https://www.upf.edu/web/econ/faculty/-/asset_publisher/6aWmmXf28uXT/persona/id/3418484

Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra

Abstract: 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.

Keywords: Job-shop scheduling; hybrid metaheuristic; optimised search heuristics; GRASP; exact methods (search for similar items in EconPapers)
JEL-codes: C61 M11 (search for similar items in EconPapers)
Date: 2007-01
New Economics Papers: this item is included in nep-cmp
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://econ-papers.upf.edu/papers/1050.pdf Whole Paper (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:upf:upfgen:1050

Access Statistics for this paper

More papers in Economics Working Papers from Department of Economics and Business, Universitat Pompeu Fabra
Bibliographic data for series maintained by ( this e-mail address is bad, please contact ).