Scheduling with constrained processor allocation for interval orders

DOI10.1016/0305-0548(93)90114-XMaRDI QIDQ2367418zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 512916
• An efficient parallel algorithm for scheduling interval ordered tasks
• scientific article; zbMATH DE number 1759465
• scientific article; zbMATH DE number 512819
• Scheduling Interval Ordered Tasks in Parallel
• Scheduling interval ordered tasks with non-uniform deadlines
• scientific article; zbMATH DE number 4072695
• An optimal algorithm for scheduling interval ordered tasks with communication on \(N\) processors
• Order scheduling in an environment with dedicated resources in parallel
• Optimal interval scheduling with a resource constraint

Cites work

• Approximation algorithms for combinatorial problems
• Complexity of Scheduling under Precedence Constraints
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• NP-complete scheduling problems
• On a scheduling problem where a job can be executed only by a limited number of processors
• On the complexity of scheduling problems for parallel/pipelined machines
• Scheduling Interval-Ordered Tasks
• Scheduling unit-time jobs on processors with different capabilities
• UET-scheduling with constrained processor allocations

Cited in

(12)

• Mutual exclusion scheduling with interval graphs or related classes. I
• Scheduling multiprocessor tasks -- An overview
• A new approximation algorithm for UET-scheduling with chain-type precedence constraints.
• UET-scheduling with chain-type precedence constraints
• Machine scheduling with contiguous processing constraints
• ILP formulations for scheduling ordered tasks on a bounded number of processors
• scientific article; zbMATH DE number 512819 (Why is no real title available?)
• scientific article; zbMATH DE number 512916 (Why is no real title available?)
• Scheduling with Concurrency-Based Constraints
• Scheduling Interval Ordered Tasks in Parallel
• Explicit Modelling of Multiple Intervals in a Constraint Generation Procedure for Multiprocessor Scheduling
• Better permutations for the single-processor scheduling with time restrictions

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

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