Sule, Dileep R.; Huang, Kin Yann Sequency on two and three machines with setup, processing and removal times separated. (English) Zbl 0516.90038 Int. J. Prod. Res. 21, 723-732 (1983). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 18 Documents MSC: 90B35 Deterministic scheduling theory in operations research Keywords:algorithms; optimal sequence; sequencing; setup time; processing time; removal time; completion time; three machine problem; decision rules; optimum solution PDF BibTeX XML Cite \textit{D. R. Sule} and \textit{K. Y. Huang}, Int. J. Prod. Res. 21, 723--732 (1983; Zbl 0516.90038) Full Text: DOI OpenURL References: [1] JOHNSON S. M., Naval Research and Logistics Quarterly 1 pp 61– (1954) · Zbl 1349.90359 [2] MITTKN L. G., Management Science 5 pp 293– (1959) · Zbl 0995.90539 [3] SZWARC W., Naval Research and Logistics Quarterly 21 pp 145– (1974) · Zbl 0287.90010 [4] SZWARC W., Operations Research 25 pp 70– (1977) · Zbl 0379.90051 [5] YOSHIDA T., AIIE Transactions 11 pp 261– (1979) This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.