A note on scheduling multiprocessor tasks with identical processing times

Authors:
Philippe Baptiste
Affiliations:
CNRS Heudiasyc, UMR 6599, UTC, F-60200 Compiègne & Ecole Polytechnique Palaiseau, France
Venue:
Computers and Operations Research
Year:
2003

Citing 4
Cited 3

Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
Scheduling equal-length jobs on identical parallel machines

Discrete Applied Mathematics
Scheduling Algorithms

Scheduling Algorithms
Scheduling Computer and Manufacturing Processes

Scheduling Computer and Manufacturing Processes

An exact method for Pm/sds,ri/Σi=1nCi problem

Computers and Operations Research
A performance study of multiprocessor task scheduling algorithms

The Journal of Supercomputing
Scheduling two agents on uniform parallel machines with makespan and cost functions

Journal of Scheduling

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the scheduling situation where n tasks with identical processing times have to be scheduled on m parallel processors. Each task is subjected to a release date and requires simultaneously a fixed number of processors. We show that, for each fixed value of m, the problem of minimizing total completion time can be solved in polynomial time. The complexity status of the corresponding problem Pm|ri, Pi = p, sizei| Σ Ci was unknown before.