IDEAS home Printed from
   My bibliography  Save this article

A bin packing problem of the laundry washing buckets scheduling based on the buffer area


  • Quanming Cheng

    () (University of Science and Technology Beijing)

  • Sen Wu

    () (University of Science and Technology Beijing)

  • Yang Zhao

    () (Shenyang Institute of Engineering)


Abstract In this paper, we consider a class of bin packing problems from the washing reality, which is used to solve the laundry washing buckets scheduling problem in laundry procedure. First, we make some foundation concepts and propose the grouping model of washing buckets scheduling based on BPP-P. The objectives of model are as follow: (1) the buckets with clothes urgency priority are grouped preferentially; (2) the grouping model should make the whole washing tasks finished at the shortest possible. Second, we propose the algorithm of the combination of laundry buckets. Numerical examples results show as follows: (1) the maximum number of one type of clothes in the buffer area play an important role to the effect of the algorithm and the expansion of the buffer area can create more opportunity of combination; (2) because the buckets arrive by batches, the bottleneck resource may change in each group calculation and it may extend the working time of the whole task.

Suggested Citation

  • Quanming Cheng & Sen Wu & Yang Zhao, 2017. "A bin packing problem of the laundry washing buckets scheduling based on the buffer area," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(3), pages 1981-1988, November.
  • Handle: RePEc:spr:ijsaem:v:8:y:2017:i:3:d:10.1007_s13198-016-0413-7
    DOI: 10.1007/s13198-016-0413-7

    Download full text from publisher

    File URL:
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    1. Mauro Dell'Amico & José Carlos Díaz Díaz & Manuel Iori, 2012. "The Bin Packing Problem with Precedence Constraints," Operations Research, INFORMS, vol. 60(6), pages 1491-1504, December.
    2. López-Camacho, Eunice & Terashima-Marín, Hugo & Ochoa, Gabriela & Conant-Pablos, Santiago Enrique, 2013. "Understanding the structure of bin packing problems through principal component analysis," International Journal of Production Economics, Elsevier, vol. 145(2), pages 488-499.
    3. Pereira, Jordi, 2016. "Procedures for the bin packing problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 250(3), pages 794-806.
    4. Morrison, David R. & Sewell, Edward C. & Jacobson, Sheldon H., 2014. "An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset," European Journal of Operational Research, Elsevier, vol. 236(2), pages 403-409.
    5. Sternatz, Johannes, 2014. "Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry," European Journal of Operational Research, Elsevier, vol. 235(3), pages 740-754.
    Full references (including those not matched with items on IDEAS)

    More about this item


    Laundry; Bottleneck resources; Buffer area;


    Access and download statistics


    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:ijsaem:v:8:y:2017:i:3:d:10.1007_s13198-016-0413-7. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Sonal Shukla) or (Rebekah McClure). General contact details of provider: .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.