The sequencing of “related” jobs

DOI10.1002/nav.3800150103zbMath0159.49101OpenAlexW1544432995MaRDI QIDQ5545166

Salah E. Elmaghraby

Publication date: 1968

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800150103

zbMATH Keywords

operations research

Related Items

A survey of job shop scheduling problem: the types and models, Review of sequencing research, Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation, Block seriation problems: A unified approach. Reply to the problem of H. Garcia and J. M. Proth (Applied Stochastic Models and Data Analysis, 1, (1), 25–34 (1985)), A dual algorithm for the one-machine scheduling problem

Cites Work

• Finite-State Processes and Dynamic Programming