IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v327y2025i2p420-431.html

The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost

Author

Listed:
  • Li, Weidong
  • Ou, Jinwen

Abstract

The generalized assignment problem (GAP) is a foundational problem in operations research, but its progress is quite limited. In this paper we study an important special case of the GAP with fixed processing times and uniform processing costs, where the upper bound of the makespan is given, and the objective to minimize the total processing cost. We prove a critical technical lemma, which enables us to develop an approximation algorithm with an improved performance ratio of 1+(γ−1)ϵ, where ϵ∈(0,13] can be any small constant and γ is the maximum to the minimum processing cost per unit time on a machine, improving on the existing performance ratio of 2+γ3 in the literature. For the general problem when γ is arbitrarily, we show that it is NP-hard to approximate within a constant performance ratio. For the special case when γ is a constant, we present an efficient PTAS (polynomial time approximation scheme) by applying the technical lemma. Our techniques and results bring new insights into the GAP research.

Suggested Citation

  • Li, Weidong & Ou, Jinwen, 2025. "The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost," European Journal of Operational Research, Elsevier, vol. 327(2), pages 420-431.
    • Handle: RePEc:eee:ejores:v:327:y:2025:i:2:p:420-431
    DOI: 10.1016/j.ejor.2025.05.031
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221725004151
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2025.05.031?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
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Lee, Kangbok & Leung, Joseph Y-T. & Jia, Zhao-hong & Li, Wenhua & Pinedo, Michael L. & Lin, Bertrand M.T., 2014. "Fast approximation algorithms for bi-criteria scheduling with machine assignment costs," European Journal of Operational Research, Elsevier, vol. 238(1), pages 54-64.
    2. R. T. Lewis & R. G. Parker, 1982. "On a generalized bin‐packing problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 29(1), pages 119-145, March.
    3. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.
    4. Li, Weidong & Ou, Jinwen, 2024. "Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing," European Journal of Operational Research, Elsevier, vol. 314(3), pages 882-893.
    5. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "An asymptotic approximation scheme for the concave cost bin packing problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 582-586, December.
    6. Chung‐Lun Li & Zhi‐Long Chen, 2006. "Bin‐packing problem with concave costs of bin utilization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 298-308, June.
    7. Chen, Jianfu & Chu, Chengbin & Sahli, Abderrahim & Li, Kai, 2024. "A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs," European Journal of Operational Research, Elsevier, vol. 316(3), pages 856-872.
    8. Guohua Wan & Xiangtong Qi, 2010. "Scheduling with variable time slot costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(2), pages 159-171, March.
    9. Haouari, Mohamed & Mhiri, Mariem, 2024. "Lower and upper bounding procedures for the bin packing problem with concave loading cost," European Journal of Operational Research, Elsevier, vol. 312(1), pages 56-69.
    10. H. W. Lenstra, 1983. "Integer Programming with a Fixed Number of Variables," Mathematics of Operations Research, INFORMS, vol. 8(4), pages 538-548, November.
    11. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    Full references (including those not matched with items on IDEAS)

    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. Haouari, Mohamed & Mhiri, Mariem, 2024. "Lower and upper bounding procedures for the bin packing problem with concave loading cost," European Journal of Operational Research, Elsevier, vol. 312(1), pages 56-69.
    2. Roland Braune, 2022. "Packing-based branch-and-bound for discrete malleable task scheduling," Journal of Scheduling, Springer, vol. 25(6), pages 675-704, December.
    3. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.
    4. Gao, Mengxing & Liu, ChenGuang & Chen, Xi, 2025. "A bi-objective unrelated parallel machine scheduling problem with additional resources and soft precedence constraints," European Journal of Operational Research, Elsevier, vol. 325(1), pages 53-66.
    5. Wang, Ting & Hu, Qian & Lim, Andrew, 2022. "An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs," European Journal of Operational Research, Elsevier, vol. 300(1), pages 20-34.
    6. Otto, Alena & Li, Xiyu, 2020. "Product sequencing in multiple-piece-flow assembly lines," Omega, Elsevier, vol. 91(C).
    7. Benedikt, Ondřej & Módos, István & Novak, Antonin & Hanzálek, Zdeněk, 2026. "Green scheduling with time-of-use tariffs and machine states: Optimizing energy cost via branch-and-bound and bin packing strategies," European Journal of Operational Research, Elsevier, vol. 328(1), pages 64-77.
    8. Jean-François Côté & Manuel Iori, 2018. "The Meet-in-the-Middle Principle for Cutting and Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 30(4), pages 646-661, November.
    9. M. Köppe & M. Queyranne & C. T. Ryan, 2010. "Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs," Journal of Optimization Theory and Applications, Springer, vol. 146(1), pages 137-150, July.
    10. K. Aardal & R. E. Bixby & C. A. J. Hurkens & A. K. Lenstra & J. W. Smeltink, 2000. "Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 192-202, August.
    11. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    12. Kan Fang & Nelson Uhan & Fu Zhao & John Sutherland, 2016. "Scheduling on a single machine under time-of-use electricity tariffs," Annals of Operations Research, Springer, vol. 238(1), pages 199-227, March.
    13. Klaus Jansen & Lars Rohwedder, 2023. "On Integer Programming, Discrepancy, and Convolution," Mathematics of Operations Research, INFORMS, vol. 48(3), pages 1481-1495, August.
    14. Alberto Del Pia & Robert Hildebrand & Robert Weismantel & Kevin Zemmer, 2016. "Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane," Mathematics of Operations Research, INFORMS, vol. 41(2), pages 511-530, May.
    15. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    16. Eugene Lim & Tzeh Yuan Neoh & Nicholas Teh, 2025. "Fairness in Repeated Matching: A Maximin Perspective," Papers 2510.04624, arXiv.org.
    17. Elisama Araújo Silva Oliveira & Elizabeth Wanner & Elisangela Martins Sá & Sérgio Ricardo Souza, 2025. "A local branching-based solution for the multi-period cutting stock problem with tardiness, earliness, and setup costs," Journal of Heuristics, Springer, vol. 31(1), pages 1-57, March.
    18. Senergues, Victor & Brahimi, Nadjib & Cherri, Adriana Cristina & Klein, François & Péton, Olivier, 2026. "Cutting stock problem with usable leftovers: A review," European Journal of Operational Research, Elsevier, vol. 328(1), pages 1-14.
    19. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    20. Kramer, Arthur & Dell’Amico, Mauro & Iori, Manuel, 2019. "Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines," European Journal of Operational Research, Elsevier, vol. 275(1), pages 67-79.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:327:y:2025:i:2:p:420-431. 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.