Please use this identifier to cite or link to this item:
Briskorn, Dirk
Choi, Byung-Cheon
Lee, Kangbok
Leung, Joseph
Pinedo, Michael
Year of Publication: 
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 649
This paper focuses on Single machine scheduling subject to inventory constraints. Jobs add and remove items to and from, respectively, the inventory. Jobs that remove items cannot be processed if the required number of items is not available. We consider scheduling problems on a Single machine with regular objective functions Lmax ∑wjCj, ∑wjUj and ∑wjTj, and propose a genetic algorithm framework to tackle them. The focus is on discussion of different representations with respect to redundancy and corresponding decoding schemes. Moreover, we evaluate the different techniques by means of a computational study.
Machine scheduling
inventory constraints
genetic algorithm
representation schemes
Document Type: 
Working Paper

Files in This Item:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.