IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v78y1994i2p224-241.html
   My bibliography  Save this article

Maximizing the value of a space mission

Author

Listed:
  • Hall, Nicholas G.
  • Magazine, Michael J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Hall, Nicholas G. & Magazine, Michael J., 1994. "Maximizing the value of a space mission," European Journal of Operational Research, Elsevier, vol. 78(2), pages 224-241, October.
    • Handle: RePEc:eee:ejores:v:78:y:1994:i:2:p:224-241
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)90385-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Martinovic, J. & Strasdat, N. & Valério de Carvalho, J. & Furini, F., 2023. "A combinatorial flow-based formulation for temporal bin packing problems," European Journal of Operational Research, Elsevier, vol. 307(2), pages 554-574.
    2. Philippe Monmousseau, 2021. "Scheduling of a Constellation of Satellites: Creating a Mixed-Integer Linear Model," Journal of Optimization Theory and Applications, Springer, vol. 191(2), pages 846-873, December.
    3. Julia Chuzhoy & Rafail Ostrovsky & Yuval Rabani, 2006. "Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems," Mathematics of Operations Research, INFORMS, vol. 31(4), pages 730-738, November.
    4. Djamal Habet & Michel Vasquez & Yannick Vimont, 2010. "Bounding the optimum for the problem of scheduling the photographs of an Agile Earth Observing Satellite," Computational Optimization and Applications, Springer, vol. 47(2), pages 307-333, October.
    5. Charnsirisakskul, Kasarin & Griffin, Paul M. & Keskinocak, Pinar, 2006. "Pricing and scheduling decisions with leadtime flexibility," European Journal of Operational Research, Elsevier, vol. 171(1), pages 153-169, May.
    6. Zhang Ye & Hu Xiaoxuan & Zhu Waiming & Jin Peng, 2018. "Solving the Observing and Downloading Integrated Scheduling Problem of Earth Observation Satellite with a Quantum Genetic Algorithm," Journal of Systems Science and Information, De Gruyter, vol. 6(5), pages 399-420, October.
    7. Areg Karapetyan & Khaled Elbassioni & Majid Khonji & Sid Chi-Kin Chau, 2023. "Approximations for generalized unsplittable flow on paths with application to power systems optimization," Annals of Operations Research, Springer, vol. 320(1), pages 173-204, January.
    8. Alberto Caprara & Fabio Furini & Enrico Malaguti, 2013. "Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 25(3), pages 560-571, August.
    9. Li, Xueping & Wang, Jiao & Sawhney, Rapinder, 2012. "Reinforcement learning for joint pricing, lead-time and scheduling decisions in make-to-order systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 99-109.
    10. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, February.
    11. Mausser, Helmut E. & Magazine, Michael J., 1996. "Comparison of neural and heuristic methods for a timetabling problem," European Journal of Operational Research, Elsevier, vol. 93(2), pages 271-287, September.
    12. Gabrel, Virginie & Vanderpooten, Daniel, 2002. "Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite," European Journal of Operational Research, Elsevier, vol. 139(3), pages 533-542, June.
    13. J-F Cordeau & G Laporte, 2005. "Maximizing the value of an Earth observation satellite orbit," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(8), pages 962-968, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:78:y:1994:i:2:p:224-241. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.