Discrete optimization with polynomially detectable boundaries and restricted level sets

DOI10.1007/S10878-012-9546-ZzbMath1268.90034OpenAlexW2175193248MaRDI QIDQ1944392

Yakov Zinder, Gaurav Singh, Julia Memar

Publication date: 25 March 2013

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-012-9546-z

zbMATH Keywords

scheduling theorydiscrete optimizationprecedence constraintsweighted maximum lateness

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Cites Work

• NP-complete scheduling problems
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• Scheduling Tasks with Nonuniform Deadlines on Two Processors
• Complexity of Scheduling under Precedence Constraints

This page was built for publication: Discrete optimization with polynomially detectable boundaries and restricted level sets