A Lagrangian heuristic for satellite range scheduling with resource constraints

DOI10.1016/j.cor.2011.01.016zbMath1210.90045OpenAlexW2015592825MaRDI QIDQ716351

Fabrizio Rossi, Salvatore Nocella, Fabrizio Marinelli, Stefano Smriglio

Publication date: 28 April 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.01.016

zbMATH Keywords

multiprocessor schedulingapplicationssatellite communicationsLagrangian heuristictime-indexed scheduling formulation

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items

Graph colouring approaches for a satellite range scheduling problem, Route-reduction-based dynamic programming for large-scale satellite range scheduling problem, High-performance technique for satellite range scheduling, An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time, Metaheuristics for the tabu clustered traveling salesman problem, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, A continuous-time formulation for optimal task scheduling and quality-of-service assurance in nanosatellites, Solving dynamic satellite image data downlink scheduling problem via an adaptive bi-objective optimization algorithm, Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites, Judgement theorems and an approach for solving the constellation-to-ground coverage problem, A hybrid genetic algorithm for satellite image downlink scheduling problem, Approximate path searching method for single-satellite observation and transmission task planning problem, On the tractability of satellite range scheduling, QUEST -- a new quadratic decision model for the multi-satellite scheduling problem, Scheduling of a constellation of satellites: creating a mixed-integer linear model, A feasibility-ensured Lagrangian heuristic for general decomposable problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a fix-and-relax framework for a class of project scheduling problems
• On the choice of explicit stabilizing terms in column generation
• A time indexed formulation of non-preemptive single machine scheduling problems
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Scheduling multiprocessor tasks -- An overview
• On practical resource allocation for production planning and scheduling with period overlapping setups
• Current trends in deterministic scheduling
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Fix and relax heuristic for a stochastic lot-sizing problem
• Betweenness, orders and interval graphs
• The stable set problem and the thinness of a graph
• Near-Optimal Solutions of Large-Scale Single-Machine Scheduling Problems
• Solving Project Scheduling Problems by Minimum Cut Computations
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• Efficient algorithms for interval graphs and circular-arc graphs
• Time-Indexed Formulations for Machine Scheduling Problems: Column Generation
• Selected Topics in Column Generation
• Scheduling space-ground communications for the air force satellite control network