A continuous-time MILP model for short-term scheduling of make-and-pack production processes

作者：Baumann Philipp; Trautmann Norbert^*

来源：International Journal of Production Research, 2013, 51(6): 1707-1727.

DOI：10.1080/00207543.2012.694489

• make-and-pack production
• mixed-integer linear programming
• symmetry-breaking constraints
• preprocessing
• real-world production process

In process industries, make-and-pack production is used to produce food and beverages, chemicals, and metal products, among others. This type of production process allows the fabrication of a wide range of products in relatively small amounts using the same equipment. In this article, we consider a real-world production process (cf. Honkomp et al. . The curse of reality why process scheduling optimization problems are diffcult in practice. Computers %26 Chemical Engineering, 24, 323328.) comprising sequence-dependent changeover times, multipurpose storage units with limited capacities, quarantine times, batch splitting, partial equipment connectivity, and transfer times. The planning problem consists of computing a production schedule such that a given demand of packed products is fulfilled, all technological constraints are satisfied, and the production makespan is minimised. None of the models in the literature covers all of the technological constraints that occur in such make-and-pack production processes. To close this gap, we develop an efficient mixed-integer linear programming model that is based on a continuous time domain and general-precedence variables. We propose novel types of symmetry-breaking constraints and a preprocessing procedure to improve the model performance. In an experimental analysis, we show that small- and moderate-sized instances can be solved to optimality within short CPU times.

• 出版日期2013-3-15