This paper describes an algorithm that will yield an optimum sequence for n jobs requiring processing through M machines when no passing is allowed. Theoretical development utilizing combinatorial analysis precedes the algorithm and an example problem.
Richard A. Dudek, Ottis Foy Teuton, Jr., (1964) Development of M-Stage Decision Rule for Scheduling N Jobs Through M Machines. Operations Research 12(3):471-497.
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.