Citation

Baker, K. R and Trietsch, D Three Heuristic Procedures for the Stochastic Flow Shop Problem. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 330-340, 2009.

Paper


Abstract

Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained challenging. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experiments to compare their effectiveness. We find that all three are reliably better than using an arbitrary sequence, and they are capable of generating solutions close to optimal. In addition, the conditions under which they perform well can vary, and our experiments shed some light on these differences.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{2009-330-340-P, author = {K. R. Baker and D. Trietsch},
title = {Three Heuristic Procedures for the Stochastic Flow Shop Problem},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {330--340},
note = {Paper},
abstract = {Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained challenging. No computationally efficient optimization procedure exists even for the general two-machine version. In this paper, we describe three heuristic procedures for the stochastic two-machine flow shop problem and report on computational experiments to compare their effectiveness. We find that all three are reliably better than using an arbitrary sequence, and they are capable of generating solutions close to optimal. In addition, the conditions under which they perform well can vary, and our experiments shed some light on these differences.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-330-340-P.pdf} }