Mathematical Programming for an Integrated Order Batching, Assignment, Sequencing, and Routing Problem Considering Time-Window Due Dates and Heterogeneous Vehicles
摘要
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).