Bin Packing Problem with Item Time Window Conflict Dependent Profits

[1] Ju-Ning Su and Xiao-Hui Zhao. Procurement management based on integrated supply chain. Phd thesis, 2004. Search in Google Scholar

[2] Mansoor Shekarian and Mahour Mellat Parast. An integrative approach to supply chain disruption risk and resilience management: a literature review. . International Journal of Logistics Research and Applications, 24(5):427-455, 2021. Search in Google Scholar

[3] Tomás Hipólito, João Lemos Nabais, Rafael Carmona-Benítez, Miguel Ayala Botto, and Rudy R Negenborn. A centralised model predictive control framework for logistics management of coordinated supply chains of perishable goods. International Journal of Systems Science: Operations & Logistics, 9(1):1-21, 2022. Search in Google Scholar

[4] Mauro Maria Baldi, Daniele Manerba, Guido Perboli, and Roberto Tadei. A generalised bin packing problem for parcel delivery in last-mile logistics. European Journal of Operational Research, 274(3):990-999, 2019. Search in Google Scholar

[5] Teodor Gabriel Crainic, Franklin Djeumou Fomeni, and Walter Rei. Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning. Computers & Operations Research, 132:105308, 2021. Search in Google Scholar

[6] Peter Hammaer and David J Rader Jr. Efficient methods for solving quadratic 0-1 knapsack INFOR: Information Systems and Operational Research, 35(3):170-182, 1997. Search in Google Scholar

[7] Albert E Fernandes Muritiba, Manuel Iori, Enrico Malaguti, and Paolo Toth. Algorithms for the bin packing problem with conflicts. Informs Journal on computing, 22(3):401-415, 2010. Search in Google Scholar

[8] J. L. Su, S. C. Huang, K. S. Fan, J. R. Chen, and S. K. Lee. An approach method on route selection of transportation of toxic substances using hazard potential analysis. Potential analysis. In CG Soares and E Zio, editors, SAFETY AND RELIABILITY FOR MANAGING RISK, VOLS 1-3, Proceedings and Monographs in Engineering Water European Safety and Reliability Conference (ESREL 2006), Estoril, PORTUGAL, SEP 18-22, 2006. Search in Google Scholar

[9] Ruslan Sadykov and François Vanderbeck. Bin packing with conflicts: a generic branch-and- price algorithm. INFORMS Journal on Computing, 25(2):. 244-255, 2013. Search in Google Scholar

[10] Luiz FO Moura Santos, Renan Sallai Iwayama, Luísa Brandão Cavalcanti, Leandro Maciel Turi, Fabio Emanuel de Souza Morais, Gabriel Mormilho, and Claudio B Cunha. A variable neighbourhood search algorithm for the bin packing problem with compatible categories. Expert Systems with Applications,. 124:209-225, 2019. Search in Google Scholar

[11] Qiang Liu, Huibing Cheng, Tian Tian, Yongsheng Wang, Jiewu Leng, Rongli Zhao, Hao Zhang, and Lijun Wei. Algorithms for the variable-sized bin packing problem with time windows. Computers & Industrial Engineering, 155:107175, 2021. Search in Google Scholar

[12] Mauro Dell’Amico, Fabio Furini, and Manuel Iori. A branch-and-price algorithm for the temporal bin packing problem. Computers & operations research, 114:104825, 2020. Search in Google Scholar

[13] Mauro Maria Baldi, Teodor Gabriel Crainic, Guido Perboli, and Roberto Tadei. Branch- and-price and beam search algorithms for the variable cost and size bin packing problem with optional items. Annals of Operations Research, 222:125-141, 2014. Search in Google Scholar

[14] Klaus Jansen and Sabine Öhring. Approximation algorithms for time constrained scheduling. Information and computation, 132(2):85-108, 1997. Search in Google Scholar

[15] Michel Gendreau, Gilbert Laporte, and Frédéric Semet. Heuristics and lower bounds for the bin packing problem with conflicts. Computers & Operations Research, 31(3):347-358, 2004. Search in Google Scholar

[16] Ali Khanafer, François Clautiaux, and El-Ghazali Talbi. New lower bounds for bin packing European journal of operational research, 206(2):281-288, 2010. Search in Google Scholar

[17] Samir Elhedhli, Lingzi Li, Mariem Gzara, and Joe Naoum-Sawaya. A branch-and-price algorithm for the bin packing problem with conflicts. INFORMS Journal on Computing, 23(3):404-415, 2011. Search in Google Scholar

[18] Renatha Capua, Yuri Frota, Luiz Satoru Ochi, and Thibaut Vidal. A study on exponential- size neighbourhoods for the bin packing problem with conflicts. Journal of Heuristics, 24:667-695, 2018. Search in Google Scholar

[19] Tiziano Bacci and Sara Nicoloso. A heuristic algorithm for the bin packing problem with conflicts on interval graphs. Arxiv preprint arxiv. 1707.00496, 2017. Search in Google Scholar

[20] Chanaleä Munien and Absalom E Ezugwu. Metaheuristic algorithms for one-dimensional bin-packing problems: a survey of recent advances and applications. Journal of Intelligent Systems, 30(1):636-663, 2021. Search in Google Scholar

[21] Mohamed Haouari and Mehdi Serairi. Heuristics for the variable sized bin-packing problem. Computers & Operations Research, 36(10):2877-2884, 2009. Search in Google Scholar