Article ID: | iaor20125548 |
Volume: | 199 |
Issue: | 1 |
Start Page Number: | 249 |
End Page Number: | 268 |
Publication Date: | Oct 2012 |
Journal: | Annals of Operations Research |
Authors: | Fumero Yanina, Corsano Gabriela, Montagna Jorge |
Keywords: | manufacturing industries, combinatorial optimization, programming: integer |
When plants are operated under stable conditions during reasonable time periods, operation with campaigns is particularly appropriate. The regular operation of the facilities simplifies the production control, the inventory management, the plant operability, etc. A campaign includes several batches of different products that are going to be manufactured and the same one is cyclically repeated over the time horizon. In this work, a mixed integer linear programming formulation is proposed for the planning and scheduling of given multiproduct batch plants operating with campaigns. The number and size of batches for each product, the campaign composition, the assignment of batches to units and their sequencing, and the number of times that the campaign is repeated over the time horizon must be determined. Taking into account this scenario, an appropriate performance measure is the minimization of the cycle time. An asynchronous slot‐based continuous‐time representation for modeling the assignment of batches to units and their sequencing is employed, and a novel rule for determining the maximum number of slots postulated for each unit is proposed.