IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v49y2001i6p866-878.html
   My bibliography  Save this article

Generating Experimental Data for the Generalized Assignment Problem

Author

Listed:
  • H. Edwin Romeijn

    (Department of Industrial and Systems Engineering, University of Florida, 303 Weil Hall, P.O. Box 116595, Gainesville, Florida 32611-6595)

  • Dolores Romero Morales

    (Faculty of Economics and Business Administration, Maastricht University, P.O. Box 616, 6200 MD Maastricht, The Netherlands)

Abstract

The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jobs to machines such that each job is assigned to exactly one machine, subject to capacity restrictions on the machines. We propose a new stochastic model for the GAP. A tight condition on this stochastic model under which the GAP is feasible with probability one when the number of jobs goes to infinity is derived. This new stochastic model enables us to analyze the adequacy of most of the random generators given for the GAP in the literature. We demonstrate that the random generators commonly used to test solution procedures for the GAP tend to create easier problem instances when the number of machines m increases. We describe a greedy heuristic for the GAP, and use it to illustrate the results from the paper.

Suggested Citation

  • H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
  • Handle: RePEc:inm:oropre:v:49:y:2001:i:6:p:866-878
    DOI: 10.1287/opre.49.6.866.10021
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.49.6.866.10021
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.49.6.866.10021?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Adriano De Maio & Claudio Roveda, 1971. "An all Zero-One Algorithm for a Certain Class of Transportation Problems," Operations Research, INFORMS, vol. 19(6), pages 1406-1418, October.
    2. Martin Savelsbergh, 1997. "A Branch-and-Price Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 45(6), pages 831-841, December.
    3. G. Terry Ross & Richard M. Soland, 1977. "Modeling Facility Location Problems as Generalized Assignment Problems," Management Science, INFORMS, vol. 24(3), pages 345-357, November.
    4. Nanda Piersma & H. Edwin Romeijn, 1996. "Parallel machine scheduling: A probabilistic analysis," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(6), pages 897-916, September.
    5. Monique Guignard & Moshe B. Rosenwein, 1989. "Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 37(4), pages 658-663, August.
    6. A. M. Geoffrion & G. W. Graves, 1974. "Multicommodity Distribution System Design by Benders Decomposition," Management Science, INFORMS, vol. 20(5), pages 822-844, January.
    7. Cattrysse, Dirk. G. & Salomon, Marc & Van Wassenhove, Luk N., 1994. "A set partitioning heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 72(1), pages 167-174, January.
    8. Amini, Mohammad M. & Racer, Michael, 1995. "A hybrid heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 87(2), pages 343-348, December.
    9. 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.
    10. Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
    11. H. Edwin Romeijn & Nanda Piersma, 2000. "A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem," Journal of Combinatorial Optimization, Springer, vol. 4(3), pages 325-355, September.
    12. 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.
    13. Michael A. Trick, 1992. "A linear relaxation heuristic for the generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 137-151, March.
    14. Nicholas G. Hall & Marc E. Posner, 2001. "Generating Experimental Data for Computational Testing with Machine Scheduling Applications," Operations Research, INFORMS, vol. 49(6), pages 854-865, December.
    15. Mohammad M. Amini & Michael Racer, 1994. "A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem," Management Science, INFORMS, vol. 40(7), pages 868-890, July.
    16. V. Balachandran, 1976. "An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks," Operations Research, INFORMS, vol. 24(4), pages 742-759, August.
    17. T. D. Klastorin, 1979. "Note--On the Maximal Covering Location Problem and the Generalized Assignment Problem," Management Science, INFORMS, vol. 25(1), pages 107-112, January.
    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. H. Edwin Romeijn & Dolores Romero Morales, 2003. "An asymptotically optimal greedy heuristic for the multiperiod single‐sourcing problem: The cyclic case," Naval Research Logistics (NRL), John Wiley & Sons, vol. 50(5), pages 412-437, August.
    2. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.

    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. Haddadi, Salim & Ouzia, Hacene, 2004. "Effective algorithm and heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 184-190, February.
    2. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    3. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    4. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
    5. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Robert M. Nauss, 2003. "Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 249-266, August.
    7. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    8. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.
    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. 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.
    11. 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.
    12. 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.
    13. Jafar Rezaei & Negin Salimi, 2015. "Optimal ABC inventory classification using interval programming," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(11), pages 1944-1952, August.
    14. Osorio, Maria A. & Laguna, Manuel, 2003. "Logic cuts for multilevel generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 151(1), pages 238-246, November.
    15. Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
    16. 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.
    17. 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.
    18. 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.
    19. 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.
    20. Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.

    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:inm:oropre:v:49:y:2001:i:6:p:866-878. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.