Aggregating disjoint partial sub-orders – an internal logistics application

References

• Baggerly, K. A. (1995). Visual Estimation of Structure in Ranked Data [PhD thesis]. Rice University.
   Google Scholar
• Blazewicz, J., Domschke, W., & Pesch, E. (1996). The job shop scheduling problem: conventional and new solution techniques. European Journal of Operational Research, 93(1), 1–33. https://doi.org/10.1016/0377-2217(95)00362-2
   Web of Science ®Google Scholar
• Brandenburg, F. J., & Gleissner, Andreas. (2011). Comparing and Aggregating Partial Orders with Kendall Tau Distances, (Technical Report, Number MIP-1102), University of Passau, 94032 Passau, Germany.
   Google Scholar
• Brandenburg, Franz J., & Gleissner, Andreas. (2016). Ranking chain sum orders, Theoretical Computer Science, University of Passau, 94032 Passau, Germany.
   Google Scholar
• Brightwell, G., & Winkler, P. (1991). Counting linear extensions. Order, 8(3), 225–242. https://doi.org/10.1007/BF00383444
   Web of Science ®Google Scholar
• Brüggemann, R., & Carlsen, L. (2011). An improved estimation of averaged ranks of partial orders. MATCH Communications in Mathematical and in Computer Chemistry, 65, 383–414.
   Web of Science ®Google Scholar
• Caragiannis, I., Krimpas, G. A., & Voudouris, A. A. (2014). Aggregating partial rankings with applications to peer grading in massive online open courses, In CoRR.
   Google Scholar
• Conitzer, V., Davenport, A., & Kalagnanam, H. (2006). Improved bounds for computing Kemeny rankings, In AAAI (Vol. 6, pp. 620–626).
   Google Scholar
• Cormen, T., Leiserson, C., Rivest, R., & Stein, C. (2001). Introduction à l'algorithmique. Dunod.
   Google Scholar
• Critchlow, D. E. (1980). Metric methods for analyzing partially ranked data, Lecture Notes in Statistics; Vol. 34, Springer-Verlag.
   Google Scholar
• Dwork, C., Kumar, R., Naor, M., & Sivakumar, D. (2001). Rank aggregation methods for the web. In Proceedings of the 10th International World Wide Web Conference, (pp. 613–622).
   Google Scholar
• Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, Erik. (2004). Comparing and Aggregating Rankings with Ties, In PODS '04.
   Google Scholar
• Gonzalves, J. F., Mendes, J. J., & Resende, M. G. C. (2005). A hybrid genetic algorithm for the job shop scheduling problem. European Journal of Operational Research, 167(1), 77–95. https://doi.org/10.1016/j.ejor.2004.03.012
   Web of Science ®Google Scholar
• Guezzen, A. H., Sari, Z., Castagna, P., & Cardin, O. (2013). Travel time modeling and simulation of a mobile racks automated storage/retrieval system. International Journal of Engineering and Technology, 5(3), 420–423. https://doi.org/10.7763/IJET.2013.V5.588
   Google Scholar
• Han, M. H., McGinnis, L. F., Shieh, J. S., & White, J. A. (1987). On sequencing retrievals in an automated storage/retrieval system. IIE Transactions, 19(1), 56–66. https://doi.org/10.1080/07408178708975370
   Web of Science ®Google Scholar
• Kalyanaraman, P., & Keerthika, C. (2016). A review on automated storage/ retrieval systems and shuttle based storage/retrieval systems. International Journal on Recent and Innovation Trends in Computing and Communication, 4(11), 167–171. ISSN: 2321-8169.
   Google Scholar
• Kendall, M. G. (1945). The treatment of ties in ranking problems. Biometrika, 33(3), 239–251. https://doi.org/10.1093/biomet/33.3.239
   PubMed Web of Science ®Google Scholar
• Kumar, Ravi, & Vassilvitskii, Sergei. (2010). Generalized Distances between Rankings. Proceedings of the 19th International Conference on World Wide Web, USA.
   Google Scholar
• Matthews, Peter (1991). Generating a random linear extension of a partial order. The Annals of Probability, 19(3), 1367–92. https://doi.org/10.1214/aop/1176990349Institute of Mathematical Statistics.
   Web of Science ®Google Scholar
• Pietrowicz, S., Collin, J. M., & Vacher, B. (2018). Procédé de pilotage en mode tri d'un système de stockage tampon et de séquencement de charges, et unité de pilotage correspondante Référence brevet R34407FR.
   Google Scholar
• Pietrowicz, S., Collin, J. M., & Vacher, B. (2020). Procédé de pilotage en mode tri d'un système de stockage tampon et de séquencement de charges, et unit'e de pilotage correspondante Référence brevet 3087924.
   Google Scholar
• Pini, M., Rossi, F., Venable, K., & Walsh, T. (2009). Aggregating partially ordered preferences. Journal of Logic and Computation, 19(3), 475–502. https://doi.org/10.1093/logcom/exn012
   Web of Science ®Google Scholar
• Pongchairerks, P. (2016). Efficient local search algorithms for job-shop scheduling problems. International Journal of Mathematics in Operational Research, 9(2), 258–77. https://doi.org/10.1504/IJMOR.2016.077995
   Google Scholar
• Roodbergen, K. J., & Vis, I. F. A. (2009). A survey of literature on automated storage and retrieval systems. European Journal of Operational Research, 194(2), 343–362. https://doi.org/10.1016/j.ejor.2008.01.038
   Web of Science ®Google Scholar
• Tavana, M., LoPinto, F., & Smither, J. W. (2007). A hybrid distance-Based ideal-Seeking consensus ranking model. Advances in Decision Sciences. https://doi.org/10.1155/2007/20489
   Google Scholar
• Vacher, B. (2020). Techniques d'optimisation système de systèmes appliquées au pilotage de la solution GTP X-PTS pour la préparation de commandes intégrant un ASRS, thèse de doctorat. Sorbonne Universités. Université de Technologie de Compiègne. UMR 7253 CNRS UTC Heudiasyc.
   Google Scholar
• Vacher, B., Jouglet, A., Nace, D., Pietrowicz, S., & Bouznif, M. (2019). Aggregating partial orders – a case study in the internal logistics sector MISTA conference, Ningbo, China.
   Google Scholar
• Vacher, B., Jouglet, A., Nace, D., Pietrowicz, S., & Bouznif, M. (2020). Scheduling loads injection during flows merging in a collector PMS conference, Toulouse, France.
   Google Scholar
• Xia, L., & Conitzer, V. (2001). A Maximum Likelihood Approach towards Aggregating Partial Orders, Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, (pp. 446–451).
   Google Scholar
• Yang, P., Yang, K., Qi, M., Miao, L., & Ye, Bin (2017). Designing the optimal multi-deep AS/RS storage rack under full turnover-based storage policy based on non-approximate speed model of S/R machine. Transportation Research Part E: Logistics and Transportation Review, 104, 113–130. https://doi.org/10.1016/j.tre.2017.05.010
   Web of Science ®Google Scholar
• Yu, Yugang, & De Koster, René B. M. (2012). Sequencing heuristics for storing and retrieving unit loads in 3D compact automated warehousing systems. IIE Transactions, 44(2), 69–87. https://doi.org/10.1080/0740817X.2011.575441
   Web of Science ®Google Scholar