Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem.
Michel VasquezJin-Kao HaoPublished in: J. Comb. Optim. (2003)
Keyphrases
- upper bound
- scheduling problem
- permutation flowshop
- lower bound
- np hard
- flowshop
- single machine
- upper and lower bounds
- setup times
- branch and bound
- processing times
- lower and upper bounds
- tabu search
- minimizing makespan
- tight bounds
- branch and bound algorithm
- digital camera
- worst case
- precedence constraints
- earliness tardiness
- parallel machines
- total tardiness
- linear programming
- digital images
- generalization error