1. Four decades of research on the open-shop scheduling problem to minimize the makespan;Ahmadian;European Journal of Operational Research,2021
2. Number of bins and maximum lateness minimization in two-dimensional bin packing;Arbib;European Journal of Operational Research,2021
3. Algorithms for on-line bin-packing problems with cardinality constraints;Babel;Discrete Applied Mathematics,2004
4. A generalized bin packing problem for parcel delivery in last-mile logistics;Baldi;European Journal of Operational Research,2019
5. Balogh, J., Békési, J., Dósa, G., Epstein, L., & Levin, A. (2018). A new and improved algorithm for online bin packing. In Proc. of the 26th European symposium on algorithms (pp. 5:1–5:14).