A Heuristic Approach to Satellite Range Scheduling With Bounds Using Lagrangian Relaxation.
Nathanael J. K. BrownBryan ArguelloLinda K. NozickNingxiong XuPublished in: IEEE Syst. J. (2018)
Keyphrases
- lagrangian relaxation
- lower and upper bounds
- lower bound
- setup times
- upper bound
- branch and bound search
- branch and bound algorithm
- np hard
- integer programming
- precedence relations
- scheduling problem
- mixed integer program
- total weighted tardiness
- mixed integer programming
- linear programming
- feasible solution
- column generation
- dynamic programming
- single machine scheduling problem
- randomly generated test problems
- network design problem
- valid inequalities
- sequence dependent setup times
- dual decomposition
- branch and bound
- unit commitment
- worst case
- optimal solution
- multidimensional knapsack problem
- shortest path
- genetic algorithm
- lagrangian heuristic
- precedence constraints
- scheduling algorithm
- tabu search
- job shop scheduling problem
- multiple objectives
- subgradient method
- optimization problems
- single machine
- objective function