Using the generalized assignment problem in scheduling the ROSAT space telescope

DOI10.1016/S0377-2217(97)00408-6zbMATH Open0949.90056OpenAlexW2012128938MaRDI QIDQ1806665FDOQ1806665

Authors: Jörg Nowakovski, Werner Schwärzler, Eberhard Triesch 

Publication date: 29 November 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00408-6

Recommendations

• Maximizing the value of a space mission
• A constraint-based approach to satellite scheduling
• Solving the generalized assignment problem: an optimizing and heuristic approach
• R \& D planning and the generalized assignment problem
• Deux problèmes d'ordonnancement en télécommunications par satellite

zbMATH Keywords

heuristicsassignment problemscheduling problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Cites Work

• Title not available (Why is that?)
• A Multiplier Adjustment Method for the Generalized Assignment Problem
• Title not available (Why is that?)
• A property of assignment type mixed integer linear programming problems

Cited In (6)

• Scheduling satellite launch missions: an MILP approach
• Assignment problems: a golden anniversary survey
• A Survey of the Generalized Assignment Problem and Its Applications
• Title not available (Why is that?)
• Maximizing the value of a space mission
• Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem

This page was built for publication: Using the generalized assignment problem in scheduling the ROSAT space telescope

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806665)