Bounds for nonpreemptive scheduling of jobs with similar processing times on multiprocessor systems using the LPT-Algorithm.
Hans KellererPublished in: Computing (1991)
Keyphrases
- processing times
- multiprocessor systems
- worst case performance ratio
- scheduling problem
- single machine
- parallel machines
- single machine scheduling problem
- worst case
- makespan minimization
- competitive ratio
- release dates
- scheduling jobs
- setup times
- precedence constraints
- np hard
- total weighted tardiness
- dynamic programming
- identical machines
- release times
- precedence relations
- flowshop
- computational complexity
- unrelated parallel machines
- job shop scheduling problem
- optimal solution
- upper bound
- average case
- completion times
- particle swarm optimization
- lagrangian relaxation
- earliness tardiness
- number of tardy jobs
- strongly np hard
- production scheduling
- genetic algorithm
- lower and upper bounds
- parallel implementation
- error bounds
- lower bound
- objective function