Login / Signup

A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses.

Michele BarbatoAlberto CeselliGiovanni Righini
Published in: J. Sched. (2024)
Keyphrases
  • worst case
  • special case
  • computational complexity
  • database
  • optimal solution
  • dynamic programming
  • real time
  • real world
  • lower bound
  • supply chain
  • data warehouse
  • optimal control
  • pareto optimal
  • semi automated