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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Boyar J et al (2016) Online bin packing with advice. Algorithmica 74(1):507–527
Augustine J, Banerjee S, Irani S (2009) Strip packing with precedence constraints and strip packing with release times. Theor Comput Sci 410(38–40):3792–3803
Chen L, Ye D, Zhang G (2015) An asymptotic competitive scheme for online bin packing. Theor Comput Sci 607(3):446–454
Dell’Amico M, Díaz JCD, Iori M (2012) The bin packing problem with precedence constraints. Oper Res 60(6):1491–1504
Coffman Jr. E et al (2013) Bin packing approximation algorithms: survey and classification. In: Pardalos PM, Du D, Graham RL (eds) Springer, New York. pp 455–531
Fleszar K (2013) Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts. Comput Oper Res 40(1):463–474
Garey MR et al (1976) Resource constrained scheduling as generalized bin packing. J Comb Theory Ser A 21(3):257–298
LeCun B et al (2015) Bin packing with fragmentable items: presentation and approximations. Theor Comput Sci 602:50–59
Lopez-Camacho E et al (2013) Understanding the structure of bin packing problems through principal component analysis. Int J Prod Econ 145(2):488–499
Morrison DR, Sewell EC, Jacobson SH (2014) An application of the branch, bound, and remember algorithm to a new simple assembly line balancing dataset. Eur J Oper Res 236(2):403–409
Pereira J (2015) Empirical evaluation of lower bounding methods for the simple assembly line balancing problem. Int J Prod Res 53(11):3327–3340
Pereira J (2016) Procedures for the bin packing problem with precedence constraints. Eur J Oper Res 250(3):794–806
Renault MP, Rosén A, van Stee R (2015) Online algorithms with advice for bin packing and scheduling problems. Theor Comput Sci 600:155–170
Rubab S et al (2015) Adoptability study of bin-packing for scheduling jobs on volunteer grid resources. Proc Comput Sci 69:2–12
Sternatz J (2014) Enhanced multi-Hoffmann heuristic for efficiently solving real-world assembly line balancing problems in automotive industry. Eur J Oper Res 235(3):740–754
López CP (2014) MATLAB Optimization Techniques. Apress, p 292
Acknowledgements
This work is supported by National Natural Science Foundation of China (NSFC) under Grant No.71271027 and the Research Fund for the Doctoral Program of Higher Education under Grant No. 20120006110037.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cheng, Q., Wu, S. & Zhao, Y. A bin packing problem of the laundry washing buckets scheduling based on the buffer area. Int J Syst Assur Eng Manag 8 (Suppl 3), 1981–1988 (2017). https://doi.org/10.1007/s13198-016-0413-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13198-016-0413-7