Affordable Access

Publisher Website

Comparison of three scheduling methods for a batch process with a recycle

DOI: 10.1016/s1570-7946(02)80141-9
  • Computer Science
  • Mathematics


Abstract A short term scheduling problem from an industrial case is modelled in three different ways. A discretized MILP-model, a heuristic approach and a genetic algorithm are tested. The scheduling task is complicated by a recycle connection. Storage capacity for raw materials and intermediates are restricted. Some productions steps are operated continuously and some in batch mode. A one-week schedule and a two-week schedule are constructed with different models and compared with industrial results. The genetic algorithm outperforms the other approaches, though the computational efforts are larger.

There are no comments yet on this publication. Be the first to share your thoughts.