Optimization methods for large-scale production scheduling problems

Authors:
Roland Braune;Stefan Wagner;Michael Affenzeller
Affiliations:
Upper Austria University of Applied Sciences, Hagenberg;Upper Austria University of Applied Sciences, Hagenberg;Upper Austria University of Applied Sciences, Hagenberg
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 2
Cited 1

Priority rules for job shops with weighted tardiness costs

Management Science
The shifting bottleneck procedure for job shop scheduling

Management Science

A hybrid approach to large-scale job shop scheduling

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a computational study of optimization methods for production scheduling problems which can be described by a job shop model. Contrary to most existing publications in this field our research focuses on the performance of these methods with respect to large-scale problem instances. The examined methods rely on a graph model as a solution representation and have originally been designed for problems of small size. We apply them to a set of semi-randomly generated problem instances whose properties have been transferred from common (smaller) benchmarks. The experiments are based on tardiness minimization and the results are evaluated in relation to a priority rule based heuristic.