Johan Oxenstierna

Orcid: 0000-0002-6608-9621

According to our database1, Johan Oxenstierna authored at least 10 papers between 2021 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Storage Assignment Using Nested Metropolis Sampling and Approximations of Order Batching Travel Costs.
SN Comput. Sci., June, 2024

Order Picking Optimization as a Service.
PhD thesis, 2024

Attention-Based Initiative In Real Time Strategy.
Proceedings of the 2024 DiGRA International Conference: Playgrounds, 2024

2023
Efficient Order Batching Optimization Using Seed Heuristics and the Metropolis Algorithm.
SN Comput. Sci., March, 2023

Optimization of the Storage Location Assignment Problem Using Nested Annealing.
Proceedings of the Operations Research and Enterprise Systems, 2023

Storage Assignment Using Nested Annealing and Hamming Distances.
Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, 2023

2022
New Benchmarks and Optimization Model for the Storage Location Assignment Problem.
Proceedings of the 3rd International Conference on Innovative Intelligent Industrial Production and Logistics, 2022

Analysis of Computational Efficiency in Iterative Order Batching Optimization.
Proceedings of the 11th International Conference on Operations Research and Enterprise Systems, 2022

2021
Formulation of a Layout-Agnostic Order Batching Problem.
Proceedings of the Optimization and Learning - 4th International Conference, 2021

Layout-Agnostic Order-Batching Optimization.
Proceedings of the Computational Logistics - 12th International Conference, 2021


  Loading...