An Optimization Framework for Solving a Large Scale Scheduling Problem

A1 Journal article (refereed)


Internal Authors/Editors


Publication Details

List of Authors: Lastusilta T, Frankenhaeuser O, Pettersson F, Westerlund T
Publication year: 2009
Journal: Computer Aided Chemical Engineering
Journal acronym: COMPUT-AIDED CHEM EN
Volume number: 26
Start page: 525
End page: 529
Number of pages: 5
ISSN: 1570-7946


Abstract

The base of the model is a simplification of a general N-dimensional allocation formulation in [3]. The Just-In-Time (JIT) principle is considered and is achieved by a piecewise linear objective function penalty, for each order, penalizing late and early orders. The rolling horizon implementation used a time window with 20 groups of orders, which corresponds to a 3 week schedule. The framework has been applied for production scheduling at a Finnish supplier of packaging materials based on ethylene and polypropylene. The studied plastic producing company had over 3000 orders in 1 year to be scheduled on 4 of their printing machines. However, only a group of two machines is considered at one time, due to the similarity of these machines. In paper the scheduling model in GAMS implementation is presented and, furthermore, the rolling horizon implementation is described.


Keywords

GAMS, industrial applications, Large scale problems, MILP, Production scheduling

Last updated on 2019-21-11 at 04:25