IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v206y2013i1p611-62610.1007-s10479-012-1175-5.html
   My bibliography  Save this article

Exact and approximate methods for a one-dimensional minimax bin-packing problem

Author

Listed:
  • Michael Brusco
  • Hans Köhn
  • Douglas Steinley

Abstract

One-dimensional bin-packing problems require the assignment of a collection of items to bins with the goal of optimizing some criterion related to the number of bins used or the ‘weights’ of the items assigned to the bins. In many instances, the number of bins is fixed and the goal is to assign the items such that the sums of the item weights for each bin are approximately equal. Among the possible applications of one-dimensional bin-packing in the field of psychology are the assignment of subjects to treatments and the allocation of students to groups. An especially important application in the psychometric literature pertains to splitting of a set of test items to create distinct subtests, each containing the same number of items, such that the maximum sum of item weights across all bins is minimized. In this context, the weights typically correspond to item statistics derived from difficulty and discrimination indices. We present a mixed zero-one integer linear programming (MZOILP) formulation of this one-dimensional minimax bin-packing problem and develop an approximate procedure for its solution that is based on the simulated annealing algorithm. In two comparisons that focused on 34 practically-sized test problems (up to 6000 items and 300 bins), the simulated annealing heuristic generally provided better solutions than were obtained when using a commercial mathematical programming software package to solve the MZOILP formulation directly. Copyright Springer Science+Business Media, LLC 2013

Suggested Citation

  • Michael Brusco & Hans Köhn & Douglas Steinley, 2013. "Exact and approximate methods for a one-dimensional minimax bin-packing problem," Annals of Operations Research, Springer, vol. 206(1), pages 611-626, July.
    • Handle: RePEc:spr:annopr:v:206:y:2013:i:1:p:611-626:10.1007/s10479-012-1175-5
    DOI: 10.1007/s10479-012-1175-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-012-1175-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-012-1175-5?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. Wim Linden, 1981. "Using aptitude measurements for the optimal assignment of subjects to treatments with and without mastery scores," Psychometrika, Springer;The Psychometric Society, vol. 46(3), pages 257-274, September.
    2. K R Baker & S G Powell, 2002. "Methods for assigning students to groups: a study of alternative objective functions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(4), pages 397-404, April.
    3. Mauro Dell’Amico & Silvano Martello, 1995. "Optimal Scheduling of Tasks on Identical Parallel Processors," INFORMS Journal on Computing, INFORMS, vol. 7(2), pages 191-200, May.
    4. Wim Linden & Ellen Boekkooi-Timminga, 1989. "A maximin model for IRT-based test design with practical constraints," Psychometrika, Springer;The Psychometric Society, vol. 54(2), pages 237-247, June.
    5. Gary Klein & Jay E. Aronson, 1991. "Optimal clustering: A model and method," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 447-461, June.
    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. Bassem Jarboui & Saber Ibrahim & Abdelwaheb Rebai, 2010. "A new destructive bounding scheme for the bin packing problem," Annals of Operations Research, Springer, vol. 179(1), pages 187-202, September.
    2. Absalom E Ezugwu & Olawale J Adeleke & Serestina Viriri, 2018. "Symbiotic organisms search algorithm for the unrelated parallel machines scheduling with sequence-dependent setup times," PLOS ONE, Public Library of Science, vol. 13(7), pages 1-23, July.
    3. Iori, Manuel & de Lima, Vinícius L. & Martello, Silvano & Miyazawa, Flávio K. & Monaci, Michele, 2021. "Exact solution techniques for two-dimensional cutting and packing," European Journal of Operational Research, Elsevier, vol. 289(2), pages 399-415.
    4. Rico Walter & Martin Wirth & Alexander Lawrinenko, 2017. "Improved approaches to the exact solution of the machine covering problem," Journal of Scheduling, Springer, vol. 20(2), pages 147-164, April.
    5. 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.
    6. Fröhlich von Elmbach, Alexander & Scholl, Armin & Walter, Rico, 2019. "Minimizing the maximal ergonomic burden in intra-hospital patient transportation," European Journal of Operational Research, Elsevier, vol. 276(3), pages 840-854.
    7. Kris Boudt & Edgars Jakobsons & Steven Vanduffel, 2018. "Block rearranging elements within matrix columns to minimize the variability of the row sums," 4OR, Springer, vol. 16(1), pages 31-50, March.
    8. Mauro Dell'Amico & Silvano Martello, 1999. "Reduction of the Three-Partition Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 17-30, July.
    9. Guopeng Song & Roel Leus, 2022. "Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms," INFORMS Journal on Computing, INFORMS, vol. 34(6), pages 3059-3079, November.
    10. Silvano Martello & David Pisinger & Daniele Vigo, 2000. "The Three-Dimensional Bin Packing Problem," Operations Research, INFORMS, vol. 48(2), pages 256-267, April.
    11. Daniel Kowalczyk & Roel Leus, 2017. "An exact algorithm for parallel machine scheduling with conflicts," Journal of Scheduling, Springer, vol. 20(4), pages 355-372, August.
    12. Mauro Dell'Amico & Manuel Iori & Silvano Martello & Michele Monaci, 2008. "Heuristic and Exact Algorithms for the Identical Parallel Machine Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 333-344, August.
    13. Johnny C. Ho & Ivar Massabò & Giuseppe Paletta & Alex J. Ruiz-Torres, 2019. "A note on posterior tight worst-case bounds for longest processing time schedules," 4OR, Springer, vol. 17(1), pages 97-107, March.
    14. Oluf Faroe & David Pisinger & Martin Zachariasen, 2003. "Guided Local Search for the Three-Dimensional Bin-Packing Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 267-283, August.
    15. Antonio Frangioni & Emiliano Necciari & Maria Grazia Scutellà, 2004. "A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems," Journal of Combinatorial Optimization, Springer, vol. 8(2), pages 195-220, June.
    16. Rico Walter & Alexander Lawrinenko, 2020. "A characterization of optimal multiprocessor schedules and new dominance rules," Journal of Combinatorial Optimization, Springer, vol. 40(4), pages 876-900, November.
    17. Theresa M. Roeder & Robert M. Saltzman, 2014. "Schedule-Based Group Assignment Using Constraint Programming," INFORMS Transactions on Education, INFORMS, vol. 14(2), pages 63-72, February.
    18. Kayse Lee Maass & Vera Mann Hey Lo & Anna Weiss & Mark S. Daskin, 2015. "Maximizing Diversity in the Engineering Global Leadership Cultural Families," Interfaces, INFORMS, vol. 45(4), pages 293-304, August.
    19. Martijn G. de Jong & Jan-Benedict E. M. Steenkamp & Bernard P. Veldkamp, 2009. "A Model for the Construction of Country-Specific Yet Internationally Comparable Short-Form Marketing Scales," Marketing Science, INFORMS, vol. 28(4), pages 674-689, 07-08.
    20. Dmitry Krass & Anton Ovchinnikov, 2006. "The University of Toronto’s Rotman School of Management Uses Management Science to Create MBA Study Groups," Interfaces, INFORMS, vol. 36(2), pages 126-137, April.

    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:annopr:v:206:y:2013:i:1:p:611-626:10.1007/s10479-012-1175-5. 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.