Complexity of Project Scheduling Problem with Nonrenewable Resources

DOI10.1007/978-3-540-77903-2_66zbMath1209.90185OpenAlexW1550881191MaRDI QIDQ5391960

Tatyana A. Shcherbinina, Vladimir V. Servakh

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_66

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Cites Work

• Complexity Results for Multiprocessor Scheduling under Resource Constraints
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of Project Scheduling Problem with Nonrenewable Resources