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

Using the generalized assignment problem in scheduling the ROSAT space telescope

Author

Listed:
  • Nowakovski, Jorg
  • Schwarzler, Werner
  • Triesch, Eberhard

Abstract

No abstract is available for this item.

Suggested Citation

  • Nowakovski, Jorg & Schwarzler, Werner & Triesch, Eberhard, 1999. "Using the generalized assignment problem in scheduling the ROSAT space telescope," European Journal of Operational Research, Elsevier, vol. 112(3), pages 531-541, February.
    • Handle: RePEc:eee:ejores:v:112:y:1999:i:3:p:531-541
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(97)00408-6
    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.

    References listed on IDEAS

    as
    1. Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Salim Haddadi, 2019. "Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem," 4OR, Springer, vol. 17(3), pages 261-295, September.
    2. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Behiri, Walid & Belmokhtar-Berraf, Sana & Chu, Chengbin, 2018. "Urban freight transport using passenger rail network: Scientific issues and quantitative analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 227-245.
    2. Corbett, Charles J. & Debets, Frank J.C. & Van Wassenhove, Luk N., 1995. "Decentralization of responsibility for site decontamination projects: A budget allocation approach," European Journal of Operational Research, Elsevier, vol. 86(1), pages 103-119, October.
    3. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2011. "Maximal network reliability for a stochastic power transmission network," Reliability Engineering and System Safety, Elsevier, vol. 96(10), pages 1332-1339.
    4. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    5. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2012. "Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS," European Journal of Operational Research, Elsevier, vol. 218(3), pages 735-746.
    6. Lorenzo Ros-McDonnell & M. de-la-Fuente-Aragon & Marija Bogataj, 2012. "An approximate algorithm for optimal logistics of heavy and variable size items," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 1-17, March.
    7. Samuel Bazzi & Arya Gaduh & Alexander D. Rothenberg & Maisy Wong, 2016. "Skill Transferability, Migration, and Development: Evidence from Population Resettlement in Indonesia," American Economic Review, American Economic Association, vol. 106(9), pages 2658-2698, September.
    8. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    9. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    10. Sabyasachi Mitra & Ishwar Murthy, 1998. "A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 40-55, February.
    11. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
    12. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    13. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    14. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    15. Tragantalerngsak, Suda & Holt, John & Ronnqvist, Mikael, 2000. "An exact method for the two-echelon, single-source, capacitated facility location problem," European Journal of Operational Research, Elsevier, vol. 123(3), pages 473-489, June.
    16. Atan, Tankut S. & Pandit, Ram, 1996. "Auxiliary tool allocation in flexible manufacturing systems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 642-659, March.
    17. Lu Yang & Leishan Zhou & Hanxiao Zhou & Chang Han & Wenqiang Zhao, 2023. "A Lagrangian Method for Calculation of Passing Capacity on a Railway Hub Station," Mathematics, MDPI, vol. 11(6), pages 1-20, March.
    18. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
    19. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 627, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    20. Matusiak, M. & de Koster, M.B.M. & Saarinen, J., 2015. "Data-driven warehouse optimization," ERIM Report Series Research in Management ERS-2015-008-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:112:y:1999:i:3:p:531-541. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.