Nonpreemptive scheduling of independent tasks with prespecified processor allocations

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199412)41:7<959::AID-NAV3220410708>3.0.CO;2-K" /><959::AID-NAV3220410708>3.0.CO;2-K 10.1002/1520-6750(199412)41:7<959::AID-NAV3220410708>3.0.CO;2-KzbMath0833.90065OpenAlexW1970504435MaRDI QIDQ4319223

No author found.

Publication date: 26 March 1996

Full work available at URL: https://doi.org/10.1002/1520-6750(199412)41:7<959::aid-nav3220410708>3.0.co;2-k

zbMATH Keywords

branch-and-bound algorithmmakespancomparability graphsgraph-theoretic approachmaximum weighted cliquepolynomial instancesscheduling independent tasksnonpreemptive

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (15)

An approximation result for a duo-processor task scheduling problem ⋮ Scheduling: agreement graph vs resource constraints ⋮ An approximation algorithm for scheduling on three dedicated machines ⋮ Shop scheduling problems with multiprocessor tasks on dedicated processors ⋮ Efficiency and effectiveness of normal schedules on three dedicated processors ⋮ Scheduling independent tasks with multiple modes ⋮ Branch and bound methods for scheduling problems with multiprocessor tasks on dedicated processors ⋮ Solving the resource constrained project scheduling problem with optimization subroutine library ⋮ Branch‐and‐bound approach for optima localization in scheduling multiprocessor jobs ⋮ Scheduling groups of tasks with precedence constraints on three dedicated processors. ⋮ Comparability graph augmentation for some multiprocessor scheduling problems ⋮ Scheduling multiprocessor tasks -- An overview ⋮ Unnamed Item ⋮ Heuristics for multimode scheduling problems with dedicated resources ⋮ Multi-resource shop scheduling with resource flexibility

Cites Work

• Unnamed Item
• Complexity of scheduling multiprocessor tasks with prespecified processors allocations
• A Fast Algorithm for the Decomposition of Graphs and Posets

This page was built for publication: Nonpreemptive scheduling of independent tasks with prespecified processor allocations