An efficient approach for the multiprocessor non-preemptive strictly periodic task scheduling problem.
Omar KermiaPublished in: J. Syst. Archit. (2017)
Keyphrases
- scheduling problem
- single machine
- processing times
- flowshop
- np hard
- setup times
- database machines
- tabu search
- scheduling algorithm
- precedence constraints
- parallel machines
- job shop scheduling problem
- earliness tardiness
- highly parallel
- multiprocessor systems
- permutation flowshop
- strongly np hard
- release dates
- total tardiness
- sequence dependent setup times
- maximum lateness
- single processor
- evolutionary algorithm
- single machine scheduling problem
- list scheduling