Improved lower bounds for the early/tardy scheduling problem with no idle time.
Jorge M. S. ValenteRui A. F. S. AlvesPublished in: J. Oper. Res. Soc. (2005)
Keyphrases
- scheduling problem
- single machine
- lower bound
- np hard
- upper bound
- tabu search
- setup times
- processing times
- flowshop
- permutation flowshop
- randomly generated test problems
- total tardiness
- branch and bound algorithm
- maximum lateness
- precedence constraints
- release dates
- upper and lower bounds
- strongly np hard
- branch and bound
- competitive ratio
- minimizing makespan
- optimal solution
- objective function
- single machine scheduling problem
- quadratic assignment problem
- parallel machines
- lower and upper bounds
- neural network
- genetic algorithm
- vc dimension
- data structure