The cyclic separation scheduling problem

From MaRDI portal

Revision as of 10:16, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4149196

Jump to:navigation, search

DOI10.1002/nav.3800240408zbMath0372.90063OpenAlexW1978178804MaRDI QIDQ4149196

Prabhakant Sinha, Ronald D. Armstrong

Publication date: 1977

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

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Processes with alternating activities ⋮ The history of the application of mathematical programming to menu planning ⋮ A mathematical programming system for preference and compatibility maximized menu planning and scheduling

This page was built for publication: The cyclic separation scheduling problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4149196&oldid=17955476"