Discrete-time mixed-integer programming models and solution methods for production scheduling in multistage facilities |
| |
Affiliation: | Nanyang Technological University, 50 Nanyang Avenue, Singapore 639798;Department of Chemical and Biological Engineering, University of Wisconsin–Madison, 1415 Engineering Dr., Madison, WI 53706, USA |
| |
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. |
| |
Keywords: | Sequential production environments Resource-constrained project scheduling Tightening constraints Reformulations |
本文献已被 ScienceDirect 等数据库收录! |
|