A MINLP/RCPSP decomposition approach for the short-term planning of batch production

Trautmann, Ν.; Schwindt, Christoph

doi:10.1016/s1570-7946(05)80060-4

Cited by 3 publications

(3 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…One of the main impacts of alternative (multi-)objective functions is that permutation schedules (Hartmann (1998)), which represent a solution as a permutation of activities and are used in many state-of-the-art works on RCPSP, are no longer guaranteed to yield optimal solutions. Trautmann and Schwindt (2005); Wilson et al (2012) Setup times Survey: Mika et al (2006) Batch scheduling, e.g. Schwindt and Trautmann (2000); Potts and Kovalyov (2000) Multiple modes MRCPSP, Survey: Wȩglarz et al (2011), e.g.…”

Section: Problem Featuresmentioning

confidence: 99%

See 1 more Smart Citation

A local search framework for industrial test laboratory scheduling

Mischek

Musliu

2021

Ann Oper Res

View full text Add to dashboard Cite

In this paper we introduce a complex scheduling problem that arises in a real-world industrial test laboratory, where a large number of activities has to be performed using qualified personnel and specialized equipment, subject to time windows and several other constraints. The problem is an extension of the well-known Resource-Constrained Project Scheduling Problem and features multiple heterogeneous resources with very general availability restrictions, as well as a grouping phase, where the jobs have to be assembled from smaller units. We describe an instance generator for this problem and publicly available instance sets, both randomly generated and real-world data. Finally, we present and evaluate different metaheuristic approaches to solve the scheduling subproblem, where the assembled jobs are already provided. Our results show that Simulated Annealing can be used to achieve very good results, in particular for large instances, where it is able to consistently find better solutions than a state-of-the-art constraint programming solver within reasonable time.

show abstract

Section: Problem Featuresmentioning

confidence: 99%

“…The only paper using a similarly explicit approach to grouping small activities into larger units is by Trautmann and Schwindt (2005). They decompose a batch-scheduling problem into two independent subproblems, of which the first assembles the batches and the second produces a schedule for the previously created batches.…”

Section: Problem Featuresmentioning

confidence: 99%

A local search framework for industrial test laboratory scheduling

Mischek

Musliu

2021

Ann Oper Res

View full text Add to dashboard Cite

show abstract

“…The contribution of this paper is a novel formulation of the batching problem as a mixed-integer linear program. In contrast to the models presented in [9] and [11], this new formulation is linear and allows for taking into account alternative processing units with unit-specific lower and upper bounds on the batch sizes. In an experimental performance analysis, we combined this formulation with the priority-rule based method of [3] and applied the resulting approach to a set of 28 test instances generated by varying the primary requirements for a complex sample production process presented in [7].…”

Section: Introductionmentioning

confidence: 99%

A MIP/RCPSP decomposition approach to short-term planning in chemical batch production with non-identical parallel processing units

Trautmann

Fink

Sagebiel

et al. 2007

2007 IEEE International Conference on Industrial Engineering and Engineering Management

Self Cite

View full text Add to dashboard Cite

We consider the problem of planning and scheduling physical and chemical processes on a multiproduct chemical batch production plant. Such a plant consists of several multi-purpose processing units and storage facilities of limited capacity. Given primary requirements for final products, the problem consists in generating an appropriate set of batches for each process and scheduling the processing of those batches on the processing units subject to different types of technological constraints. In the literature the short-term planning problem is generally modeled as a monolithic mixed-integer linear program. Due to the combinatorial nature of the problem, those models generally cannot be used when dealing with problem instances of practical size. In this paper we propose a two-level approach which is based on a decomposition of the problem into a batching and a batch scheduling problem. We formulate the batching problem as a mixed-integer linear program, which allows for considering the execution of processes on alternative processing units with unit-specific lower and upper bounds on the batch sizes. The batch scheduling problem can be solved using a specific method known from the literature. We report on computational results for a sample production process from the chemical engineering literature.

show abstract