An efficient genetic algorithm for job shop scheduling with tardiness objectives

We consider job shop scheduling problems with release and due-dates, as well as various tardiness objectives. To date, no efficient general-purpose heuristics have been developed for these problems. genetic algorithms can be applied almost directly, but come along with apparent weaknesses.

MoreLess

Year of publication:	2002-12-18
Authors:	Mattfeld, Dirk C. ; Bierwirth, Christian
Published in:	Martin-Luther-Universität Halle-Wittenberg - Lehrstuhl für Produktion und Logistik - Publikationen European Journal of Operations Research ; 155 (2004), S. 616-630
Publisher:	Institut für Betriebswirtschaftslehre <Halle, Saale>
Subject:	Logistik \| logistics \| Genetischer Algorithmus \| genetic algorithm \| Algorithmus \| Prioritätsregel

freely available

Full text |

More access options

Check Google Scholar

I need help

More details

Extent:	226304 bytes 15 p. application/pdf
Type of publication:	Article
Language:	English
Classification:	Lot sizing and Scheduling ; Nonlinear programming ; Individual Articles ; No country specification
Source:	USB Cologne (business full texts)

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