Scheduling satellite launch missions: an MILP approach

DOI10.1007/s10951-012-0304-yzbMath1297.90033OpenAlexW2161205670MaRDI QIDQ398832

Paolo Brandimarte

Publication date: 18 August 2014

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-012-0304-y

zbMATH Keywords

integer programmingscheduling for strategic designspace applications

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)

Related Items

A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector

Uses Software

• Tabu search

Cites Work

• Multi-criteria scheduling: an agent-based approach for expert knowledge integration
• A heuristic for the multi-satellite, multi-orbit and multi-user management of Earth observation satellites
• Robust optimization models for project scheduling with resource availability cost
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Using the generalized assignment problem in scheduling the ROSAT space telescope
• Exploiting process plan flexibility in production scheduling: A multi-objective approach
• Executing production schedules in the face of uncertainties: a review and some future directions
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• AFSCN scheduling: how the problem and solution have evolved
• Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets
• Ending Inventory Valuation in Multiperiod Production Scheduling
• Multi-item capacitated lot-sizing with demand uncertainty
• A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times
• An Algorithm for the Space-Shuttle Scheduling Problem
• LEOS—Optimal Satellite Launch Policies: The Static Case
• Job shop scheduling with a non-regular objective: A comparison of neighbourhood structures based on a sequencing/timing decomposition
• An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item