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 proceedingChapter

1 Scopus citations


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 languageEnglish (US)
Title of host publication18th European Symposium on Computer Aided Process Engineering
EditorsBertrand Braunschweig, Xavier Joulia
Number of pages6
StatePublished - 2008
Externally publishedYes

Publication series

NameComputer Aided Chemical Engineering
ISSN (Print)1570-7946

All Science Journal Classification (ASJC) codes

  • General Chemical Engineering
  • Computer Science Applications


  • decomposition algorithm
  • grid computing
  • mixed-integer programming


Dive into the research topics of 'Using grid computing to solve hard planning and scheduling problems'. Together they form a unique fingerprint.

Cite this