Using grid computing to solve hard planning and scheduling problems

Michael C. Ferris; Christos T. Maravelias; Arul Sundaramoorthy

doi:10.1016/S1570-7946(08)80108-3

Using grid computing to solve hard planning and scheduling problems

Michael C. Ferris
, Christos T. Maravelias
, Arul Sundaramoorthy

Research output: Chapter in Book/Report/Conference proceeding › Chapter

1 Scopus citations

Abstract

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.

Original language	English (US)
Title of host publication	18th European Symposium on Computer Aided Process Engineering
Editors	Bertrand Braunschweig, Xavier Joulia
Pages	617-622
Number of pages	6
DOIs	https://doi.org/10.1016/S1570-7946(08)80108-3
State	Published - 2008
Externally published	Yes

Publication series

Name	Computer Aided Chemical Engineering
Volume	25
ISSN (Print)	1570-7946

All Science Journal Classification (ASJC) codes

General Chemical Engineering
Computer Science Applications

Keywords

decomposition algorithm
grid computing
mixed-integer programming

Access to Document

10.1016/S1570-7946(08)80108-3

Cite this

@inbook{08a1e0bc75a7425199fc03830b3f8fab,

title = "Using grid computing to solve hard planning and scheduling problems",

abstract = "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.",

keywords = "decomposition algorithm, grid computing, mixed-integer programming",

author = "Ferris, \{Michael C.\} and Maravelias, \{Christos T.\} and Arul Sundaramoorthy",

year = "2008",

doi = "10.1016/S1570-7946(08)80108-3",

language = "English (US)",

isbn = "9780444532275",

series = "Computer Aided Chemical Engineering",

pages = "617--622",

editor = "Bertrand Braunschweig and Xavier Joulia",

booktitle = "18th European Symposium on Computer Aided Process Engineering",

}

Using grid computing to solve hard planning and scheduling problems. / Ferris, Michael C.; Maravelias, Christos T.; Sundaramoorthy, Arul.
18th European Symposium on Computer Aided Process Engineering. ed. / Bertrand Braunschweig; Xavier Joulia. 2008. p. 617-622 (Computer Aided Chemical Engineering; Vol. 25).

Research output: Chapter in Book/Report/Conference proceeding › Chapter

TY - CHAP

T1 - Using grid computing to solve hard planning and scheduling problems

AU - Ferris, Michael C.

AU - Maravelias, Christos T.

AU - Sundaramoorthy, Arul

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 - https://www.scopus.com/pages/publications/52749088140

UR - https://www.scopus.com/pages/publications/52749088140#tab=citedBy

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 -

Using grid computing to solve hard planning and scheduling problems

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this