Landscape Regularity and Random Walks for the Job-Shop Scheduling Problem

TWe perform a novel analysis of the ﬁtness landscape of thejob-shop scheduling problem (JSP). In contrast to other well-known combinatorial optimization problems, we show that the landscape of the JSP is non-regular, in that the connectivity of solutions is variable.

MoreLess

Year of publication:	2004
Authors:	Bierwirth, Christian ; Mattfeld, Dirk Christian ; Watson, Jean-Paul
Published in:	Martin-Luther-Universität Halle-Wittenberg - Lehrstuhl für Produktion und Logistik - Publikationen Evolutionary Computation in Combinatorial Optimization. Springer-Verlag, Berlin u.a. 2004, S. 21-30
Publisher:	Institut für Betriebswirtschaftslehre <Halle, Saale>
Subject:	Reihenfolgeproblem \| Optimierung \| Nonsmooth optimization \| Algorithmus \| Kombination

freely available

Full text |

More access options

Check Google Scholar

I need help

More details

Extent:	395264 bytes 21 p. application/pdf
Type of publication:	Article
Language:	English
Classification:	Production and Logistics, Operations Management ; Operations research. Other aspects ; Individual Articles ; No country specification
Source:	USB Cologne (business full texts)

Persistent link: https://www.econbiz.de/10005847540