Scheduling with constrained processor allocation for interval orders

DOI10.1016/0305-0548(93)90114-XzbMath0779.90042OpenAlexW1993953065MaRDI QIDQ2367418

Klaus Jansen

Publication date: 10 August 1993

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(93)90114-x

zbMATH Keywords

heuristicinterval ordersprecedence constrained scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (4)

UET-scheduling with chain-type precedence constraints ⋮ A new approximation algorithm for UET-scheduling with chain-type precedence constraints. ⋮ Mutual exclusion scheduling with interval graphs or related classes. I ⋮ Scheduling multiprocessor tasks -- An overview

Cites Work

• Unnamed Item
• On a scheduling problem where a job can be executed only by a limited number of processors
• Scheduling unit-time jobs on processors with different capabilities
• UET-scheduling with constrained processor allocations
• Approximation algorithms for combinatorial problems
• NP-complete scheduling problems
• Scheduling Interval-Ordered Tasks
• Complexity of Scheduling under Precedence Constraints
• On the complexity of scheduling problems for parallel/pipelined machines

This page was built for publication: Scheduling with constrained processor allocation for interval orders