Models and optimization approaches for flexible job shop scheduling with lot sizing / Andrzej Bożek (Faculty of Electrical and Computer Engineering, Rzeszow University of Technology), Frank Werner (Faculty of Mathematics, Otto-von-Guericke-University)
Loading...
Download959.08 KB
Models and optimization approaches for flexible job shop scheduling with lot sizing
Discovery
885238028
URN
urn:nbn:de:gbv:3:2-71500
DOI
ISBN
ISSN
Koordinaten
Skalierung
dc.contributor.contributor
Other contributor
Publication history
[Magdeburg] : [Otto-von-Guericke-Universität Magdeburg, Fakultät für Mathematik], December 4, 2016
Content
1 Online-Ressource (29 Seiten, 0,93 MB) : Diagramme
Edition
Language
eng
Comment
Literaturverzeichnis: Seite 27-29
Serienangabe der Homepage entnommen
Abstract
Abstract: Models and optimization approaches are developed for a flexible job shop scheduling problem with lot streaming and lot sizing of the variable sublots. A two-stage optimization procedure is proposed. First, the makespan value is minimized with the smallest sublots defined for the problem instance. This makes it possible to shorten the makespan significantly, because each sublot is transferred separately to the next operation of a job. In the second stage, the sizes of the sublots are maximized without increasing the obtained makespan value. In this way, the number of sublots and transport activities is limited together with the related manufacturing cost. Two objectives are defined for the second stage. The first one is the maximization of the sum of the sublot sizes of all operations, the second one is the maximization of the number of the operations which do no need to be split at all. A mixed-integer linear programming, constraint programming, and graph-based models are implemented for the problem. Two optimization approaches are developed and compared in computational experiments for each stage and objective, one approach is based on a third-party solver, and the second one on an independent own implementation, namely a tabu search and a greedy constructive heuristic.
Series
Preprints ; 2016,10 ppn:622944983