An MILP-based reordering algorithm for complex industrial scheduling and rescheduling

A1 Originalartikel i en vetenskaplig tidskrift (referentgranskad)


Interna författare/redaktörer


Publikationens författare: Roslof J, Harjunkoski I, Bjorkqvist J, Karlsson S, Westerlund T
Förläggare: PERGAMON-ELSEVIER SCIENCE LTD
Publiceringsår: 2001
Tidskrift: Computers and Chemical Engineering
Tidskriftsakronym: COMPUT CHEM ENG
Volym: 25
Nummer: 4-6
Artikelns första sida, sidnummer: 821
Artikelns sista sida, sidnummer: 828
Antal sidor: 8
ISSN: 0098-1354


Abstrakt

The challenging structure as well as the extensive economical potential of solving various scheduling problems has fascinated numerous researchers during the recent decades. Despite the significant progress made in the fields, of operations research and process systems engineering (Puigjaner, Comp. Chem. Eng., 23 (1999): S929-S943; Shah, Proceedings of FOCAPO'98, Snowbird, Utah, USA, 1998) the complexity of many industrial-size scheduling problems means that a global optimal solution cannot be reached within a reasonable computational time. In these cases, the production schedule must be generated using e.g. some kind of sophisticated heuristics, which can often lead to suboptimal solutions. In this paper, we introduce a Mixed Integer Linear Programming (MILP) based algorithm, which can be efficiently used to improve an existing feasible, but non-optimal, production schedule or to reschedule jobs in the case of changed operational parameters. The algorithm has been successfully applied to certain scheduling problems in both the paper-converting and pharmaceutical industry. (C) 2001 Elsevier Science Ltd. All rights reserved.


Nyckelord

heuristics, MILP, paper-converting industry, scheduling, sequence-dependent setup times

Senast uppdaterad 2019-16-07 vid 06:54