Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Dudek et al. (Mon,) studied this question.
synapsesocial.com/papers/6a179cd24f2b3115b012c9d2 — DOI: https://doi.org/10.1287/opre.12.3.471
Richard A. Dudek
Texas Tech University
Ottis Foy Teuton
Operations Research
Texas Tech University
Building similarity graph...
Analyzing shared references across papers
Loading...
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: