A note on scheduling multiprocessor tasks with identical processing times.

DOI10.1016/S0305-0548(02)00116-8zbMath1047.90019MaRDI QIDQ1413834

Philippe Baptiste

Publication date: 17 November 2003

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

zbMATH Keywords

Dynamic programmingIdentical processing timesMultiprocessor task scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items

Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ An exact method for \(Pm/sds, r_{i}/ \sum^{n}_{i=1} C_{i}\) problem ⋮ The consecutive multiprocessor job scheduling problem ⋮ A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ Scheduling two agents on uniform parallel machines with~makespan and cost functions ⋮ Two-agent scheduling on uniform parallel machines with min-max criteria

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling UET task systems with concurrency on two parallel identical processors
• Scheduling equal-length jobs on identical parallel machines
• Scheduling multiprocessor tasks for mean flow time criterion
• Complexity of Scheduling Parallel Task Systems
• Concurrent Task Systems