Tardiness Bounds for FIFO Scheduling on Multiprocessors.
Hennadiy LeontyevJames H. AndersonPublished in: ECRTS (2007)
Keyphrases
- scheduling problem
- minimize total
- parallel machines
- single machine
- scheduling jobs
- single machine scheduling problem
- processing times
- sequence dependent setup times
- lower bound
- distributed memory
- release dates
- upper bound
- scheduling policies
- flowshop
- shared memory
- precedence constraints
- number of tardy jobs
- average case
- setup times
- round robin
- high speed
- batch processing
- heavy traffic
- job shop scheduling problem
- total cost
- scheduling algorithm
- branch and bound algorithm
- worst case
- np hard
- upper and lower bounds
- data flow
- tabu search
- job shop
- dynamic programming
- tardiness penalties
- genetic algorithm
- error bounds
- flexible manufacturing systems
- optimal policy
- identical parallel machines