A Lagrangian heuristic for satellite range scheduling with resource constraints
- 30 November 2011
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 38 (11), 1572-1583
- https://doi.org/10.1016/j.cor.2011.01.016
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- On a Fix-and-Relax Framework for a Class of Project Scheduling ProblemsAnnals of Operations Research, 2005
- Fix and Relax Heuristic for a Stochastic Lot-Sizing ProblemComputational Optimization and Applications, 2005
- Near-Optimal Solutions of Large-Scale Single-Machine Scheduling ProblemsINFORMS Journal on Computing, 2005
- Exploring relaxation induced neighborhoods to improve MIP solutionsMathematical Programming, 2004
- Scheduling Space–Ground Communications for the Air Force Satellite Control NetworkJournal of Scheduling, 2004
- Local branchingMathematical Programming, 2003
- General multiprocessor task schedulingNaval Research Logistics (NRL), 1999
- Scheduling multiprocessor tasks — An overviewEuropean Journal of Operational Research, 1996
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problemsEuropean Journal of Operational Research, 1996
- On practical resource allocation for production planning and scheduling with period overlapping setupsEuropean Journal of Operational Research, 1994