Heuristic decomposition and LP-based scheduling in make-and-pack production

Baumann, Philipp (December 2011). Heuristic decomposition and LP-based scheduling in make-and-pack production. In: IEEE International Conference on Industrial Engineering and Engineering Management. Singapore. 06.12.-09.12 2011.

In this paper, we are concerned about the short-term scheduling of industrial make-and-pack production processes. The planning problem consists in minimizing the production makespan while meeting given end-product demands. Sequence-dependent changeover times, multi-purpose storage units with finite capacities, quarantine times, batch splitting, partial equipment connectivity, material transfer times, and a large number of operations contribute to the complexity of the problem. Known MILP formulations cover all technological constraints of such production processes, but only small problem instances can be solved in reasonable CPU times. In this paper, we develop a heuristic in order to tackle large instances. Under this heuristic, groups of batches are scheduled iteratively using a novel MILP formulation; the assignment of the batches to the groups and the scheduling sequence of the groups are determined using a priority rule. We demonstrate the applicability by means of a real-world production process.

Item Type:

Conference or Workshop Item (Speech)

Division/Institute:

03 Faculty of Business, Economics and Social Sciences > Department of Business Management > Institute of Financial Management > Professorship for Quantitative Methods in Business Administration

UniBE Contributor:

Baumann, Philipp

Subjects:

600 Technology > 650 Management & public relations

Language:

English

Submitter:

Larissa Notz

Date Deposited:

28 Nov 2014 13:40

Last Modified:

31 Jul 2017 08:19

Additional Information:

original paper: http://boris.unibe.ch/39382/

URI:

https://boris.unibe.ch/id/eprint/60523

Actions (login required)

Edit item Edit item
Provide Feedback