Upper bounds for the SPOT 5 daily photograph scheduling problem
From MaRDI portal
Publication:1411341
zbMath1046.90030MaRDI QIDQ1411341
Publication date: 27 October 2003
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Search theory (90B40) Deterministic scheduling theory in operations research (90B35)
Related Items
Strengthened 0-1 linear formulation for the daily satellite mission planning, Graph colouring approaches for a satellite range scheduling problem, A hybrid binary artificial bee colony algorithm for the satellite photograph scheduling problem, A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites, A two-phase scheduling method with the consideration of task clustering for Earth observing satellites, A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds, A threshold search based memetic algorithm for the disjunctively constrained knapsack problem, Strong formulation for the spot 5 daily photograph scheduling problem, A mixed integer linear programming model for multi-satellite scheduling, Heuristic scheduling algorithm oriented dynamic tasks for imaging satellites, A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem, Solving the swath segment selection problem through Lagrangean relaxation, Approximate path searching method for single-satellite observation and transmission task planning problem, Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite, QUEST -- a new quadratic decision model for the multi-satellite scheduling problem
