TY - GEN
T1 - Fast generation of production schedules on a single machine
AU - Weidenhiller, Andreas
AU - Jodlbauer, Herbert
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/38449089928
U2 - 10.1007/978-3-540-75867-9_108
DO - 10.1007/978-3-540-75867-9_108
M3 - Conference contribution
SN - 9783540758662
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 861
EP - 869
BT - Computer Aided Systems Theory - EUROCAST 2007 - 11th International Conference on Computer Aided Systems Theory, Revised Selected Papers
PB - Springer
T2 - 11th International Conference on Computer Aided Systems Theory, EUROCAST 2007
Y2 - 12 February 2007 through 16 February 2007
ER -