IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v6y2002i1d10.1023_a1013370208101.html
   My bibliography  Save this article

3-Partitioning Problems for Maximizing the Minimum Load

Author

Listed:
  • Shi Ping Chen

    (Zhejiang University)

  • Yong He

    (Zhejiang University)

  • Guohui Lin

    (University of Alberta
    University of Waterloo
    McMaster University)

Abstract

The optimization versions of the 3-Partitioning and the Kernel 3-Partitioning problems are considered in this paper. For the objective to maximize the minimum load of the m subsets, it is shown that the MODIFIED LPT algorithm has performance ratios (3m − 1)/(4m − 2) and (2m − 1)/(3m − 2), respectively, in the worst case.

Suggested Citation

  • Shi Ping Chen & Yong He & Guohui Lin, 2002. "3-Partitioning Problems for Maximizing the Minimum Load," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 67-80, March.
    • Handle: RePEc:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013370208101
    DOI: 10.1023/A:1013370208101
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1013370208101
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1013370208101?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 search for a different version of it.

    References listed on IDEAS

    as
    1. Luitpold Babel & Hans Kellerer & Vladimir Kotov, 1998. "Thek-partitioning problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(1), pages 59-82, February.
    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. Alexander Lawrinenko & Stefan Schwerdfeger & Rico Walter, 2018. "Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem," Journal of Heuristics, Springer, vol. 24(2), pages 173-203, April.

    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. Elif Akçalı & Alper Üngör & Reha Uzsoy, 2005. "Short‐term capacity allocation problem with tool and setup constraints," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(8), pages 754-764, December.
    2. Dell'Amico, Mauro & Iori, Manuel & Martello, Silvano & Monaci, Michele, 2006. "Lower bounds and heuristic algorithms for the ki-partitioning problem," European Journal of Operational Research, Elsevier, vol. 171(3), pages 725-742, June.
    3. Alexander Lawrinenko & Stefan Schwerdfeger & Rico Walter, 2018. "Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem," Journal of Heuristics, Springer, vol. 24(2), pages 173-203, April.
    4. Guajardo, Mario & Rönnqvist, Mikael, 2015. "Operations research models for coalition structure in collaborative logistics," European Journal of Operational Research, Elsevier, vol. 240(1), pages 147-159.

    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:spr:jcomop:v:6:y:2002:i:1:d:10.1023_a:1013370208101. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.