Upper bounds for revenue maximization in a satellite scheduling problem.
Thierry BenoistBenoît RottembourgPublished in: 4OR (2004)
Keyphrases
- upper bound
- scheduling problem
- permutation flowshop
- lower bound
- single machine
- np hard
- objective function
- upper and lower bounds
- setup times
- tabu search
- worst case
- remote sensing
- flowshop
- minimizing makespan
- lower and upper bounds
- branch and bound algorithm
- precedence constraints
- tight bounds
- processing times
- sample complexity
- branch and bound
- upper bounding
- error probability
- tight upper and lower bounds
- total tardiness
- budget constraints
- sequence dependent setup times
- parallel machines
- orbit determination
- dynamic pricing
- efficiently computable
- special case
- active learning
- genetic algorithm