Openshop scheduling under linear resources constraints

DOI10.1002/(SICI)1520-6750(199802)45:1%3C51::AID-NAV3%3E3.0.CO;2-KMaRDI QIDQ4381875zbMATH OpenOpenAlexFDO

Authors 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%3C51::aid-nav3%3E3.0.co;2-k

zbMATH Keywords

NP-hardnessopenshoppolynomial algorithmsresources constraints

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• A Note On The Complexity Of Openshop Scheduling Problems
• The open shop scheduling problem
• Publication:4936534
• Linear time approximation scheme for the multiprocessor open shop problem
• scientific article; zbMATH DE number 808800
• On the complexity of preemptive openshop scheduling problems
• Solving the open shop scheduling problem
• Open shop scheduling with some additional constraints
• Openshop and flowshop scheduling to minimize sum of completion times
• Approximation algorithms for parallel open shop scheduling

Cited in

(7)

• Job shop scheduling with unit time operations under resource constraints and release dates
• The stock size problem
• Resource scheduling with supply constraint and linear cost
• scientific article; zbMATH DE number 1263266 (Why is no real title available?)
• scientific article; zbMATH DE number 6843804 (Why is no real title available?)
• Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function
• Unit-time scheduling problems with time dependent resources

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

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