Data-Driven Modeling and Optimization of the Order Consolidation Problem in E-Warehousing

References

• Anagnostopoulos GC, Rabadi G (2002) A simulated annealing algorithm for the unrelated parallel machine scheduling problem. Proc. 5th Biannual World Automation Congress (IEEE, Piscataway, NJ), 115–120.Google Scholar
• Balakrishnan N, Kanet JJ, Sridharan V (1999) Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput. Oper. Res. 26(2):127–141.Google Scholar
• Belouadah H, Potts CN (1994) Scheduling identical parallel machines to minimize total weighted completion time. Discrete Appl. Math. 48(3):201–218.Google Scholar
• Boysen N, Stephan K, Weidinger F (2019) Manual order consolidation with put walls: The batched order bin sequencing problem. EURO J. Transportation Logist. 8(2):169–193.Google Scholar
• Bozer YA, Sharp GP (1985) An empirical evaluation of a general purpose automated order accumulation and sortation system used in batch picking. Material Flow 2:111–131.Google Scholar
• Bozer YA, Quiroz MA, Sharp GP (1988) An evaluation of alternative control strategies and design issues for automated order accumulation and sortation systems. Material Flow 4(4):265–282.Google Scholar
• Bülbül K, Şen H (2017) An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J. Scheduling 20(4):373–389.Google Scholar
• Chan LMA, Muriel A, Simchi-Levi D (1998) Parallel machine scheduling, linear programming, and parameter list scheduling heuristics. Oper. Res. 46(5):729–741.Link, Google Scholar
• Chen F, Wang H, Qi C, Xie Y (2013) An ant colony optimization routing algorithm for two order pickers with congestion consideration. Comput. Indust. Engrg. 66(1):77–85.Google Scholar
• Chen JF (2015) Unrelated parallel-machine scheduling to minimize total weighted completion time. J. Intelligent Manufacturing 26(6):1099–1112.Google Scholar
• Chen ZL, Powell WB (1999a) A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. Eur. J. Oper. Res. 116(1):220–232.Google Scholar
• Chen ZL, Powell WB (1999b) Solving parallel machine scheduling problems by column generation. INFORMS J. Comput. 11(1):78–94.Link, Google Scholar
• Chen ZL, Powell WB (2003) Exact algorithms for scheduling multiple families of jobs on parallel machines. Naval Res. Logist. 50(7):823–840.Google Scholar
• De P, Ghosh JB, Wells CE (1994) Due-date assignment and early/tardy scheduling on identical parallel machines. Naval Res. Logist. 41(1):17–32.Google Scholar
• De Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: A literature review. Eur. J. Oper. Res. 182(2):481–501.Google Scholar
• Fanjul-Peyro L, Ruiz R (2010) Iterated greedy local search methods for unrelated parallel machine scheduling. Eur. J. Oper. Res. 207(1):55–69.Google Scholar
• Gademann A, Van Den Berg JP, Van Der Hoff HH (2001) An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Trans. 33(5):385–398.Google Scholar
• Graham RL (1966) Bounds for certain multiprocessing anomalies. Bell System Tech. J. 45(9):1563–1581.Google Scholar
• Grosse E, Glock C, Ballester-Ripoll R (2014) A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions. Technical Report, Darmstadt Technical University, Darmstadt, Germany.Google Scholar
• Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: A comprehensive review. Eur. J. Oper. Res. 177(1):1–21.Google Scholar
• Henn S, Koch S, Wäscher G (2012) Order batching in order picking warehouses: A survey of solution approaches. Manzini R, ed. Warehousing in the Global Supply Chain (Springer, London), 105–137.Google Scholar
• Hong S, Johnson AL, Peters BA (2012) Batch picking in narrow-aisle order picking systems with consideration for picker blocking. Eur. J. Oper. Res. 221(3):557–570.Google Scholar
• Hsieh LF, Huang YC (2011) New batch construction heuristics to optimise the performance of order picking systems. Internat. J. Production Econom. 131(2):618–630.Google Scholar
• Hwang H, Oh Y, Lee Y (2004) An evaluation of routing policies for order-picking operations in low-level picker-to-part system. Internat. J. Production Res. 42(18):3873–3889.Google Scholar
• Jampani J, Mason SJ (2008) Column generation heuristics for multiple machine, multiple orders per job scheduling problems. Ann. Oper. Res. 159(1):261–273.Google Scholar
• Janssenswillen G (2019) processmapR: Construct process maps using event data. Accessed January 14, 2020, https://www.bupar.net.Google Scholar
• Jia J, Mason SJ (2009) Semiconductor manufacturing scheduling of jobs containing multiple orders on identical parallel machines. Internat. J. Production Res. 47(10):2565–2585.Google Scholar
• Johnson ME (1997) The impact of sorting strategies on automated sortation system performance. IIE Trans. 30(1):67–77.Google Scholar
• Kaplan S, Rabadi G (2013) Simulated annealing and metaheuristic for randomized priority search algorithms for the aerial refuelling parallel machine scheduling problem with due date-to-deadline windows and release times. Engrg. Optim. 45(1):67–87.Google Scholar
• Kim DW, Kim KH, Jang W, Chen FF (2002) Unrelated parallel machine scheduling with setup times using simulated annealing. Robotics Comput.-Integrated Manufacturing 18(3–4):223–231.Google Scholar
• Kowalczyk D, Leus R (2017) An exact algorithm for parallel machine scheduling with conflicts. J. Scheduling 20(4):355–372.Google Scholar
• Lee JH, Yu JM, Lee DH (2013) A tabu search algorithm for unrelated parallel machine scheduling with sequence-and machine-dependent setups: Minimizing total tardiness. Internat. J. Adv. Manufacturing Tech. 69(9–12):2081–2089.Google Scholar
• Liaw CF (2016) A branch-and-bound algorithm for identical parallel machine total tardiness scheduling problem with preemption. J. Indust. Production Engrg. 33(6):426–434.Google Scholar
• Lin B, Jeng A (2004) Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs. Internat. J. Production Econom. 91(2):121–134.Google Scholar
• Lin SW, Ying KC (2015) A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems. Internat. J. Production Res. 53(4):1065–1076.Google Scholar
• Logendran R, Subur F (2004) Unrelated parallel machine scheduling with job splitting. IIE Trans. 36(4):359–372.Google Scholar
• Logendran R, McDonell B, Smucker B (2007) Scheduling unrelated parallel machines with sequence-dependent setups. Comput. Oper. Res. 34(11):3420–3438.Google Scholar
• Mason SJ, Chen JS (2010) Scheduling multiple orders per job in a single machine to minimize total completion time. Eur. J. Oper. Res. 207(1):70–77.Google Scholar
• McNaughton R (1959) Scheduling with deadlines and loss functions. Management Sci. 6(1):1–12.Link, Google Scholar
• Meller RD (1997) Optimal order-to-lane assignments in an order accumulation/sortation system. IIE Trans. 29(4):293–301.Google Scholar
• Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E (1953) Equation of state calculations by fast computing machines. J. Chemical Physics 21(6):1087–1092.Google Scholar
• Min L, Cheng W (1999) A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machines. Artificial Intelligence Engrg. 13(4):399–403.Google Scholar
• Mokotoff E (2004) An exact algorithm for the identical parallel machine scheduling problem. Eur. J. Oper. Res. 152(3):758–769.Google Scholar
• Mokotoff E, Chrétienne P (2002) A cutting plane algorithm for the unrelated parallel machine scheduling problem. Eur. J. Oper. Res. 141(3):515–525.Google Scholar
• Mönch L, Balasubramanian H, Fowler JW, Pfund ME (2005) Heuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times. Comput. Oper. Res. 32(11):2731–2750.Google Scholar
• Pan JCH, Wu MH (2012) Throughput analysis for order picking system with multiple pickers and aisle congestion considerations. Comput. Oper. Res. 39(7):1661–1672.Google Scholar
• Petersen CG, Aase G (2004) A comparison of picking, storage, and routing policies in manual order picking. Internat. J. Production Econom. 92(1):11–19.Google Scholar
• Radhakrishnan S, Ventura JA (2000) Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times. Internat. J. Production Res. 38(10):2233–2252.Google Scholar
• Ratliff HD, Rosenthal AS (1983) Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper. Res. 31(3):507–521.Link, Google Scholar
• Rauchecker G, Schryen G (2019) Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm. Comput. Oper. Res. 104:338–357.Google Scholar
• Roodbergen KJ, Koster R (2001) Routing methods for warehouses with multiple cross aisles. Internat. J. Production Res. 39(9):1865–1883.Google Scholar
• Russell ML, Meller RD (2003) Cost and throughput modeling of manual and automated order fulfillment systems. IIE Trans. 35(7):589–603.Google Scholar
• Schutten J, Leussink R (1996) Parallel machine scheduling with release dates, due dates and family setup times. Internat. J. Production Econom. 46–47:119–125.Google Scholar
• Serafini P (1996) Scheduling jobs on several machines with the job splitting property. Oper. Res. 44(4):617–628.Link, Google Scholar
• Shim SO, Kim YD (2008) A branch and bound algorithm for an identical parallel machine scheduling problem with a job splitting property. Comput. Oper. Res. 35(3):863–875.Google Scholar
• Smith WE (1956) Various optimizers for single-stage production. Naval Res. Logist. Quart. 3(1–2):59–66.Google Scholar
• Tavakkoli-Moghaddam R, Taheri F, Bazzazi M, Izadi M, Sassani F (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Comput. Oper. Res. 36(12):3224–3230.Google Scholar
• Theys C, Bräysy O, Dullaert W, Raa B (2010) Using a TSP heuristic for routing order pickers in warehouses. Eur. J. Oper. Res. 200(3):755–763.Google Scholar
• Vallada E, Ruiz R (2011) A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times. Eur. J. Oper. Res. 211(3):612–622.Google Scholar
• van Den Akker JM, Hoogeveen JA, van de Velde SL (1999) Parallel machine scheduling by column generation. Oper. Res. 47(6):862–872.Link, Google Scholar
• Van den Berg JP, Zijm W (1999) Models for warehouse management: Classification and examples. Internat. J. Production Econom. 59(1–3):519–528.Google Scholar
• Villa F, Vallada E, Fanjul-Peyro L (2018) Heuristic algorithms for the unrelated parallel machine scheduling problem with one scarce additional resource. Expert Systems Appl. 93:28–38.Google Scholar
• Weng MX, Lu J, Ren H (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Internat. J. Production Econom. 70(3):215–226.Google Scholar
• Xing W, Zhang J (2000) Parallel machine scheduling with splitting jobs. Discrete Appl. Math. 103(1–3):259–269.Google Scholar