caa a22 4500 445838787 CHVBK 20180317145337.0 cr unu---uuuuu 170323e20111001xx s 000 0 eng 10.1007/s10951-010-0219-4 doi (NATIONALLICENCE)springer-10.1007/s10951-010-0219-4 Three heuristic procedures for the stochastic, two-machine flow shop problem [Elektronische Daten] [Kenneth Baker, Dan Trietsch] Although the deterministic flow shop model is one of the most widely studied problems in scheduling theory, its stochastic analog has remained a challenge. 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 that compare their effectiveness. We focus on heuristic procedures that can be adapted for dispatching without the need for computer simulation or computer-based search. We find that all three procedures are capable of quickly generating solutions close to the best known sequences, which were obtained by extensive search. Springer Science+Business Media, LLC, 2010 Stochastic scheduling nationallicence Sequencing nationallicence Flow shop nationallicence Heuristic procedures nationallicence Baker Kenneth Tuck School, Dartmouth College, 03755, Hanover, NH, USA aut Trietsch Dan College of Engineering, American University of Armenia, Yerevan, Armenia aut Journal of Scheduling Springer US; http://www.springer-ny.com 14/5(2011-10-01), 445-454 1094-6136 14:5<445 2011 14 10951 https://doi.org/10.1007/s10951-010-0219-4 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10951-010-0219-4 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Baker Kenneth Tuck School, Dartmouth College, 03755, Hanover, NH, USA aut NATIONALLICENCE 700 1- Trietsch Dan College of Engineering, American University of Armenia, Yerevan, Armenia aut NATIONALLICENCE 773 0- Journal of Scheduling Springer US; http://www.springer-ny.com 14/5(2011-10-01), 445-454 1094-6136 14:5<445 2011 14 10951 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer