The sequencing of “related” jobs

DOI10.1002/NAV.3800150103zbMATH Open0159.49101OpenAlexW1544432995MaRDI QIDQ5545166FDOQ5545166

Authors: 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

Cites Work

• Finite-State Processes and Dynamic Programming

Cited In (5)

• A dual algorithm for the one-machine scheduling problem
• 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))

This page was built for publication: The sequencing of “related” jobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5545166)