Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/149046 
Authors: 
Year of Publication: 
1996
Series/Report no.: 
Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel No. 415
Publisher: 
Universität Kiel, Institut für Betriebswirtschaftslehre, Kiel
Abstract: 
This contribution introduces a mixed-integer programming formulation for the multi-level, multi-machine proportional lot sizing and scheduling problem. It also presents a genetic algorithm to solve that problem. The efficiency of that algorithm is due to an encoding of solutions which uses a two-dimensional matrix representation with non-binary entries rather than a simple bitstring. A computational study reveals that the proposed procedura works amazingly fast and competes with a tabu search approach that has recently been published.
Subjects: 
Multi-level lot sizing
scheduling
genetic algorithms
PLSP
Document Type: 
Working Paper
Document Version: 
Digitized Version

Files in This Item:
File
Size





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