On strictly optimal schedules for the cumulative cost-optimal scheduling problem

DOI10.1007/BF02242792zbMath0407.90042OpenAlexW1520583984MaRDI QIDQ1258252

K. Appert

Publication date: 1980

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242792

zbMATH Keywords

SchedulingComputational ComplexitySeries - Parallel Precedance RelationStrictly Optimal Schedules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Detecting race conditions in parallel programs that use one semaphore ⋮ File space utilization in database conversion

Cites Work

• Unnamed Item
• Unnamed Item
• Sequencing with Series-Parallel Precedence Constraints
• Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Scheduling to Minimize Maximum Cumulative Cost Subject to Series-Parallel Precedence Constraints

This page was built for publication: On strictly optimal schedules for the cumulative cost-optimal scheduling problem