Optimization methods for large-scale production scheduling problems

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

7 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory - EUROCAST 2007 - 11th International Conference on Computer Aided Systems Theory, Revised Selected Papers
PublisherSpringer
Pages812-819
Number of pages8
Volume4739
Edition4739
ISBN (Print)9783540758662
DOIs
Publication statusPublished - 2007
Event11th International Conference on Computer Aided Systems Theory, EUROCAST 2007 - Las Palmas de Gran Canaria, Spain
Duration: 12 Feb 200716 Feb 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4739 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Conference on Computer Aided Systems Theory, EUROCAST 2007
Country/TerritorySpain
CityLas Palmas de Gran Canaria
Period12.02.200716.02.2007

Keywords

  • Heuristic Optimization
  • Scheduling
  • Local Search

Fingerprint

Dive into the research topics of 'Optimization methods for large-scale production scheduling problems'. Together they form a unique fingerprint.

Cite this