TY - CHAP
T1 - Using grid computing to solve hard planning and scheduling problems
AU - Ferris, Michael C.
AU - Maravelias, Christos T.
AU - Sundaramoorthy, Arul
N1 - Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.
PY - 2008
Y1 - 2008
N2 - Production planning and scheduling problems routinely arise in process industries. In spite of extensive research work to develop efficient scheduling methods, existing approaches are inefficient in solving industrial-scale problems in reasonable time. In this paper we develop a dynamic decomposition scheme that exploits the structure of the problem and facilitates grid computing. We consider the problem of simultaneous batching and scheduling of multi-stage batch processes. The proposed method can be used to solve hard problems on a grid computer to optimality in reasonable time.
AB - Production planning and scheduling problems routinely arise in process industries. In spite of extensive research work to develop efficient scheduling methods, existing approaches are inefficient in solving industrial-scale problems in reasonable time. In this paper we develop a dynamic decomposition scheme that exploits the structure of the problem and facilitates grid computing. We consider the problem of simultaneous batching and scheduling of multi-stage batch processes. The proposed method can be used to solve hard problems on a grid computer to optimality in reasonable time.
KW - decomposition algorithm
KW - grid computing
KW - mixed-integer programming
UR - http://www.scopus.com/inward/record.url?scp=52749088140&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=52749088140&partnerID=8YFLogxK
U2 - 10.1016/S1570-7946(08)80108-3
DO - 10.1016/S1570-7946(08)80108-3
M3 - Chapter
AN - SCOPUS:52749088140
SN - 9780444532275
T3 - Computer Aided Chemical Engineering
SP - 617
EP - 622
BT - 18th European Symposium on Computer Aided Process Engineering
A2 - Braunschweig, Bertrand
A2 - Joulia, Xavier
ER -