This study focuses on the integrated order batching, assigning, sequencing, and routing problem (IOBASRP) in the warehouse. A new mixed-integer linear programming (MILP) is developed to simultaneously determine four decisions, including order batching, picker assignment, batch sequencing, and picker routing, considering time window due dates and heterogeneous pickers (IOBASRTWDHP).

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Mathematical Programming for an Integrated Order Batching, Assignment, Sequencing, and Routing Problem Considering Time-Window Due Dates and Heterogeneous Vehicles

  • Ali Jahed,
  • Álvaro García-Sánchez

摘要

This study focuses on the integrated order batching, assigning, sequencing, and routing problem (IOBASRP) in the warehouse. A new mixed-integer linear programming (MILP) is developed to simultaneously determine four decisions, including order batching, picker assignment, batch sequencing, and picker routing, considering time window due dates and heterogeneous pickers (IOBASRTWDHP).