Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods.
Rabia NessahChengbin ChuPublished in: Ann. Oper. Res. (2010)
Keyphrases
- release dates
- parallel machines
- lower bound
- maximum lateness
- scheduling problem
- minimize total
- identical parallel machines
- upper bound
- precedence constraints
- parallel machine scheduling problem
- sequence dependent setup times
- scheduling jobs
- np hard
- release times
- makespan minimization
- branch and bound algorithm
- single machine scheduling problem
- single machine
- shared memory
- processing times
- flowshop
- worst case
- total weighted tardiness
- competitive ratio
- optimal solution
- branch and bound
- objective function
- setup times
- single server
- strongly np hard
- lower and upper bounds
- parallel computing
- tabu search
- online algorithms
- linear programming
- simulated annealing
- lot sizing