A Lagrangian heuristic for satellite range scheduling with resource constraints
A Lagrangian heuristic for satellite range scheduling with resource constraints
F. Marinelli,Salvatore Nocella,F. Rossi,S. Smriglio
2011 · DOI: 10.1016/j.cor.2011.01.016
Computers & Operations Research · 174 Citations
TLDR
A Lagrangian version of the Fix-and-Relax MIP heuristic is developed which is shown to be equivalent to a sequence of maximum weighted independent set problems on interval graphs, providing near optimal solutions to relevant large scale test problems.