A search space analysis of the Job Shop Scheduling Problem

D.C. Mattfeld, C. Bierwirth and H. Kopfer

Annals of Operations Research, 1999, vol. 86, issue 0, 453 pages

Abstract: A computational study for the Job Shop Scheduling Problem is presented. Thereby,emphasis is put on the structure of the search space as it appears for local search. A statisticalanalysis of the search space reveals the impact of inherent properties of the problem onlocal search based heuristics. Copyright Kluwer Academic Publishers 1999

Date: 1999
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018979424002 (text/html)
Access to full text is restricted to subscribers.

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:spr:annopr:v:86:y:1999:i:0:p:441-453:10.1023/a:1018979424002

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018979424002

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().