Processing Times for Segmented Jobs with I/O Compute Overlap.
Leonard W. CottenA. M. Abd-AllaPublished in: J. ACM (1974)
Keyphrases
- processing times
- scheduling problem
- single machine
- setup times
- scheduling jobs
- release dates
- earliness tardiness
- identical machines
- single machine scheduling problem
- makespan minimization
- identical parallel machines
- number of tardy jobs
- precedence relations
- total weighted tardiness
- worst case performance ratio
- polynomially solvable
- release times
- flowshop
- resource consumption
- data transfer
- competitive ratio
- assembly line
- special case
- file system
- upper bound
- np hard