Fast generation of production schedules on a single machine

Andreas Weidenhiller, Herbert Jodlbauer

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

Abstract

Many approaches to production scheduling are based on the step by step improvement of a given schedule. For these, finding a "good" initial schedule may critically influence performance. In the following, an extremely fast and simple method is presented for finding such a schedule in the case of a continuous-time single machine problem with the goal of minimizing setup and holding costs. In the case where there are no setups, this method always finds the optimal solution. A benchmark illustrates the possibilities of the method.

Original languageEnglish
Title of host publicationComputer Aided Systems Theory - EUROCAST 2007 - 11th International Conference on Computer Aided Systems Theory, Revised Selected Papers
PublisherSpringer Verlag
Pages861-869
Number of pages9
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
CountrySpain
CityLas Palmas de Gran Canaria
Period12.02.200716.02.2007

Fingerprint Dive into the research topics of 'Fast generation of production schedules on a single machine'. Together they form a unique fingerprint.

Cite this