Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
Stable Scheduling with Random Processing Times
verfasst von : Wojciech Bożejko, Paweł Rajba, Mieczysław Wodecki
Erschienen in: Advanced Methods and Applications in Computational Intelligence
Verlag: Springer International Publishing
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
In this work stability of solutions determined by algorithms based on tabu search method for a certain (NP-hard) one-machine arrangement problem was examined. The times of tasks performance are deterministic and they also constitute random variables of the standard or the Erlang’s schedule. The best results were obtained when as a criterion to choose an element from the neighborhood convex combinations of the first and the second moments of the random goal function were accepted. In this way determined solutions are stable, i.e. little sensitive to parameters random changes.