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

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

Publication series

NameComputer Aided Chemical Engineering
Volume25
ISSN (Print)1570-7946

All Science Journal Classification (ASJC) codes

  • Chemical Engineering(all)
  • Computer Science Applications

Keywords

  • decomposition algorithm
  • grid computing
  • mixed-integer programming

Fingerprint

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

Cite this