Thek-partitioning problem
Author
Abstract
Suggested Citation
DOI: 10.1007/BF01193837
Download full text from publisher
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.
Cited by:
- 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.
- 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.
- 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.
- 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.
- 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.
More about this item
Keywords
partition; multiprocessor scheduling; worst-case;All these keywords.
Statistics
Access and download statisticsCorrections
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:mathme:v:47:y:1998:i:1:p:59-82. 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: 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.