Multi-stage simultaneous lot-sizing and scheduling for flow line production

Authors:
Florian Seeanner;Herbert Meyr
Affiliations:
Darmstadt University of Technology, Darmstadt, Germany;University of Hohenheim, Stuttgart, Germany
Venue:
OR Spectrum
Year:
2013

Citing 8
Cited 1

Solving multi-item capacitated lot-sizing problems using variable redefinition

Operations Research
Some extensions of the discrete lotsizing and scheduling problem

Management Science
Polyhedra for lot-sizing with Wagner-Whitin costs

Mathematical Programming: Series A and B
Integrating the lot-sizing and sequencing decisions for scheduling a capacitated flow line

Computers and Industrial Engineering
Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem

Management Science
The Capacitated Lot-Sizing Problem with Linked Lot Sizes

Management Science
Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)

Production Planning by Mixed Integer Programming (Springer Series in Operations Research and Financial Engineering)
Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

Journal of Heuristics

Combining the principles of variable neighborhood decomposition search and the fix&optimize heuristic to solve multi-level lot-sizing and scheduling problems

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the simultaneous lot-sizing and scheduling of several products in multi-stage flow line production systems consisting of heterogeneous parallel production lines per stage. The limited capacity of the production lines may be further reduced by sequence dependent setup times. Deterministic, dynamic demand of standard products has to be met without backlogging with the objective of minimizing sequence dependent setup, holding and production costs as well as costs for external purchase, overtime, and standby. Different mixed-integer programming (MIP) model formulations are proposed and tested using a standard MIP-solver. Furthermore, construction heuristics like LP-and-Fix and Relax-and-Fix are designed and applied. The solution quality and computational performance of these approaches are examined in several test scenarios.