Openshop scheduling under linear resources constraints

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1520-6750(199802)45:1<51::AID-NAV3>3.0.CO;2-K" /><51::AID-NAV3>3.0.CO;2-K 10.1002/(SICI)1520-6750(199802)45:1<51::AID-NAV3>3.0.CO;2-KzbMath0902.90095OpenAlexW2012404797MaRDI QIDQ4381875

O. Hamberg, Igal Adiri

Publication date: 25 March 1998

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(199802)45:1<51::aid-nav3>3.0.co;2-k

zbMATH Keywords

polynomial algorithmsNP-hardnessopenshopresources constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

This page was built for publication: Openshop scheduling under linear resources constraints