Abstract
We address the problem of production scheduling in multi-product multi-stage batch plants. Unlike most of the previous works, which propose continuous-time models, we study discrete-time mixed-integer programming models and solution methods. Specifically, we discuss two models based on network representations of the facility and develop two new models inspired by the Resource-Constrained Project Scheduling Problem. Furthermore, we propose different solution methods, including tightening methods based on processing unit availability, a reformulation based on processing unit occupancy, and an algorithm to refine approximate solutions for large-scale instances. Finally, we present a comprehensive computational study which shows that speedups of up to four orders of magnitude in are observed when our models and methods are compared to existing approaches.
Original language | English (US) |
---|---|
Pages (from-to) | 387-410 |
Number of pages | 24 |
Journal | Computers and Chemical Engineering |
Volume | 94 |
DOIs | |
State | Published - Nov 2 2016 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- General Chemical Engineering
- Computer Science Applications
Keywords
- Reformulations
- Resource-constrained project scheduling
- Sequential production environments
- Tightening constraints