Workforce Scheduling with Order-Picking Assignments in Distribution Facilities

References

• Alsheddy A , Tsang EP (2011) Empowerment scheduling for a field workforce. J. Scheduling 14(6):639–654.Crossref, Google Scholar
• Aykin T (1996) Optimal shift scheduling with multiple break windows. Management Sci. 42(4):591–602.Link, Google Scholar
• Aykin T (2000) A comparative evaluation of modeling approaches to the labor shift scheduling problem. Eur. J. Oper. Res. 125(2):381–397.Crossref, Google Scholar
• Azadeh K , De Koster R , Roy D (2019) Robotized and automated warehouse systems: Review and recent developments. Transportation Sci. 53(4):917–945.Link, Google Scholar
• Bard JF , Morton DP , Wang YM (2007) Workforce planning at USPS mail processing and distribution centers using stochastic optimization. Ann. Oper. Res. 155(1):51–78.Crossref, Google Scholar
• Barnhart C , Johnson EL , Nemhauser GL , Savelsbergh MW , Vance PH (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Bechtold SE , Jacobs LW (1990) Implicit modeling of flexible break assignments in optimal shift scheduling. Management Sci. 36(11):1339–1351.Link, Google Scholar
• Beliën J , Demeulemeester E (2008) A branch-and-price approach for integrating nurse and surgery scheduling. Eur. J. Oper. Res. 189(3):652–668.Crossref, Google Scholar
• Bertsimas D , Chang A , Mišić VV , Mundru N (2019) The airlift planning problem. Transportation Sci. 53(3):773–795.Link, Google Scholar
• Bhandari A , Scheller-Wolf A , Harchol-Balter M (2008) An exact and efficient algorithm for the constrained dynamic operator staffing problem for call centers. Management Sci. 54(2):339–353.Link, Google Scholar
• Bodnar P , De Koster R , Azadeh K (2017) Scheduling trucks in a cross-dock with mixed service mode dock doors. Transportation Sci. 51(1):112–131.Link, Google Scholar
• Boysen N , Briskorn D , Emde S (2017) Sequencing of picking orders in mobile rack warehouses. Eur. J. Oper. Res. 259(1):293–307.Crossref, Google Scholar
• Brusco MJ , Jacobs LW (1998) Personnel tour scheduling when starting-time restrictions are present. Management Sci. 44(4):534–547.Link, Google Scholar
• Brusco MJ , Jacobs LW (2000) Optimal models for meal-break and start-time flexibility in continuous tour scheduling. Management Sci. 46(12):1630–1641.Link, Google Scholar
• Chen T-L , Cheng C-Y , Chen Y-Y , Chan L-K (2015) An efficient hybrid algorithm for integrated order batching, sequencing and routing problem. Internat. J. Production Econom. 159:158–167.Crossref, Google Scholar
• Clarke G , Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568–581.Link, Google Scholar
• Contardo C , Desaulniers G , Lessard F (2015) Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks 65(1):88–99.Crossref, Google Scholar
• Cordeau J-F , Laporte G , Pasin F , Ropke S (2010) Scheduling technicians and tasks in a telecommunications company. J. Scheduling 13(4):393–409.Crossref, Google Scholar
• Côté M-C , Gendron B , Rousseau L-M (2011) Grammar-based integer programming models for multiactivity shift scheduling. Management Sci. 57(1):151–163.Link, Google Scholar
• Dahmen S , Rekik R , Soumis F (2018) An implicit model for multi-activity shift scheduling problems. J. Scheduling 21(3):285–304.Crossref, Google Scholar
• Danna E , Le Pape C (2005) Branch-and-price heuristics: A case study on the vehicle routing problem with time windows. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 99–129.Crossref, Google Scholar
• Dantzig GB (1954) Letter to the editor—A comment on Edie’s “Traffic delays at toll booths”. J. Oper. Res. Soc. Amer. 2(3):339–341.Link, Google Scholar
• Dellaert N , Dashty Saridarq F , Van Woensel T , Crainic TG (2018) Branch-and-price–based algorithms for the two-echelon vehicle routing problem with time windows. Transportation Sci. 53(2):463–479.Link, Google Scholar
• Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper. Res. 58(1):179–192.Link, Google Scholar
• Desaulniers G , Villeneuve D (2000) The shortest path problem with time windows and linear waiting costs. Transportation Sci. 34(3):312–319.Link, Google Scholar
• Desaulniers G , Desrosiers J , Solomon MM (2002) Accelerating strategies in column generation methods for vehicle routing and crew scheduling problems. Ribeiro CC, Hansen P, eds. Essays and Surveys in Metaheuristics (Kluwer, Boston), 309–324.Crossref, Google Scholar
• Desaulniers G , Lessard F , Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3):387–404.Link, Google Scholar
• Dror M (1994) Note on the complexity of the shortest path models for column generation in VRPTW. Oper. Res. 42(5):977–978.Link, Google Scholar
• Edie LC (1954) Traffic delays at toll booths. J. Oper. Res. Soc. Amer. 2(2):107–138.Link, Google Scholar
• Elahipanah M , Desaulniers G , Lacasse-Guay E (2013) A two-phase mathematical-programming heuristic for flexible assignment of activities and tasks to work shifts. J. Scheduling 16(5):443–460.Crossref, Google Scholar
• Elsayed E , Lee M-K (1996) Order processing in automated storage/retrieval systems with due dates. IIE Trans. 28(7):567–577.Crossref, Google Scholar
• Elsayed E , Lee M-K , Kim S , Scherer E (1993) Sequencing and batching procedures for minimizing earliness and tardiness penalty of order retrievals. Internat. J. Production Res. 31(3):727–738.Crossref, Google Scholar
• Ernst AT , Jiang H , Krishnamoorthy M , Owens B , Sier D (2004a) An annotated bibliography of personnel scheduling and rostering. Ann. Oper. Res. 127(1–4):21–144.Crossref, Google Scholar
• Ernst AT , Jiang H , Krishnamoorthy M , Sier D (2004b) Staff scheduling and rostering: A review of applications, methods and models. Eur. J. Oper. Res. 153(1):3–27.Crossref, Google Scholar
• European Parliament, Council of the European Union (1991) Council Directive 91/533/EEC of October 14, 1991 on an employer’s obligation to inform employees of the conditions applicable to the contract or employment relationship, https://eur-lex.europa.eu/legal-content/EN/ALL/?uri=CELEX%3A31991L0533.Google Scholar
• European Parliament, Council of the European Union (2003). Directive 2003/88/EC of the European Parliament and of the Council of November 4, 2003 concerning certain aspects of the organisation of working time, http://eur-lex.europa.eu/legal-content/EN/ALL/?uri=CELEX:32003L0088.Google Scholar
• European Parliament, Council of the European Union (2019) Directive (EU) 2019/1152 of the European Parliament and of the Council of June 20, 2019 on transparent and predictable working conditions in the European Union, https://eur-lex.europa.eu/legal-content/EN/TXT/?uri=CELEX:32019L1152.Google Scholar
• Feillet D , Gendreau M , Rousseau L-M (2007) New refinements for the solution of vehicle routing problems with branch and price. INFOR: Inform. Systems Oper. Res. 45(4):239–256.Crossref, Google Scholar
• Feillet D , Dejax P , Gendreau M , Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216–229.Crossref, Google Scholar
• Fırat M , Hurkens C (2012) An improved MIP-based approach for a multi-skill workforce scheduling problem. J. Scheduling 15(3):363–380.Crossref, Google Scholar
• Fischetti M , Martello S , Toth P (1987) The fixed job schedule problem with spread-time constraints. Oper. Res. 35(6):849–858.Link, Google Scholar
• Fischetti M , Martello S , Toth P (1989) The fixed job schedule problem with working-time constraints. Oper. Res. 37(3):395–403.Link, Google Scholar
• Gérard M , Clautiaux F , Sadykov R (2016) Column generation based approaches for a tour scheduling problem with a multi-skill heterogeneous workforce. Eur. J. Oper. Res. 252(3):1019–1030.Crossref, Google Scholar
• Goel A (2010) Truck driver scheduling in the European Union. Transportation Sci. 44(4):429–441.Link, Google Scholar
• Goel A , Irnich S (2017) An exact method for vehicle routing and truck driver scheduling problems. Transportation Sci. 51(2):737–754.Link, Google Scholar
• Goel A , Kok L (2012) Truck driver scheduling in the United States. Transportation Sci. 46(3):317–326.Link, Google Scholar
• Gurobi Optimization (2020) Gurobi Optimizer Reference Manual , version 9.0, https://www.gurobi.com//wp-content//plugins//hd_documentations//documentation//9.0//refman.pdf.Google Scholar
• Henn S (2015) Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses. Flexible Service Manufacturing J. 27(1):86–114.Crossref, Google Scholar
• Henn S , Schmid V (2013) Metaheuristics for order batching and sequencing in manual order picking systems. Comput. Indust. Engrg. 66(2):338–351.Crossref, Google Scholar
• Holder A (2005) Navy personnel planning and the optimal partition. Oper. Res. 53(1):77–89.Link, Google Scholar
• Irnich S (2008) Resource extension functions: Properties, inversion, and generalization to segments. OR Spectrum 30(1):113–148.Crossref, Google Scholar
• Irnich S , Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 33–65.Crossref, Google Scholar
• Kallehauge B , Larsen J , Madsen OB , Solomon MM (2005) Vehicle routing problem with time windows. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer, New York), 67–98.Crossref, Google Scholar
• Kolen AW , Lenstra JK , Papadimitriou CH , Spieksma FC (2007) Interval scheduling: A survey. Naval Res. Logist. 54(5):530–543.Crossref, Google Scholar
• Krishnamoorthy M , Ernst AT , Baatar D (2012) Algorithms for large scale shift minimisation personnel task scheduling problems. Eur. J. Oper. Res. 219(1):34–48.Crossref, Google Scholar
• Kroon LG , Salomon M , Van Wassenhove LN (1995) Exact and approximation algorithms for the operational fixed interval scheduling problem. Eur. J. Oper. Res. 82(1):190–205.Crossref, Google Scholar
• Matusiak M , De Koster R , Saarinen J (2017) Utilizing individual picker skills to improve order batching in a warehouse. Eur. J. Oper. Res. 263(3):888–899.Crossref, Google Scholar
• Matusiak M , De Koster R , Kroon L , Saarinen J (2014) A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse. Eur. J. Oper. Res. 236(3):968–977.Crossref, Google Scholar
• Michel R (2016) 2016 warehouse/DC operations survey: Ready to confront complexity. Supply Chain Management Rev. , (November 8), https://www.scmr.com/article/2016_warehouse_dc_operations_survey_ready_to_confront_complexity.Google Scholar
• Pisinger D , Ropke S (2010) Large neighborhood search. Gendreau M, Potvin JY, eds. Handbook of Metaheuristics (Springer, Boston), 399–419.Crossref, Google Scholar
• Quak HJ , De Koster R (2007) Exploring retailers’ sensitivity to local sustainability policies. J. Oper. Management 25(6):1103–1122.Crossref, Google Scholar
• Rasmussen MS , Justesen T , Dohn A , Larsen J (2012) The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. Eur. J. Oper. Res. 219(3):598–610.Crossref, Google Scholar
• Ropke S , Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Sci. 40(4):455–472.Link, Google Scholar
• Scholz A , Schubert D , Wäscher G (2017) Order picking with multiple pickers and due dates—Simultaneous solution of order batching, batch assignment and sequencing, and picker routing problems. Eur. J. Oper. Res. 263(2):461–478.Crossref, Google Scholar
• Smet P , Ernst AT , Berghe GV (2016) Heuristic decomposition approaches for an integrated task scheduling and personnel rostering problem. Comput. Oper. Res. 76:60–72.Crossref, Google Scholar
• Spliet R , Dabia S , Van Woensel T (2018) The time window assignment vehicle routing problem with time-dependent travel times. Transportation Sci. 52(2):261–276.Link, Google Scholar
• Stenger A , Vigo D , Enz S , Schwind M (2013) An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transportation Sci. 47(1):64–80.Link, Google Scholar
• Sungur B , Özgüven C , Kariper Y (2017) Shift scheduling with break windows, ideal break periods, and ideal waiting times. Flexible Services Manufacturing J. 29(2):203–222.Crossref, Google Scholar
• Thompson GM (1988) A comparison of techniques for scheduling non-homogeneous employees in a service environment subject to non-cyclical demand. Unpublished PhD thesis, Florida State University.Google Scholar
• Thompson GM (1995) Improved implicit optimal modeling of the labor shift scheduling problem. Management Sci. 41(4):595–607.Link, Google Scholar
• Thompson GM , Pullman ME (2007) Scheduling workforce relief breaks in advance vs. in real-time. Eur. J. Oper. Res. 181(1):139–155.Crossref, Google Scholar
• Tilk C , Goel A (2020) Bidirectional labeling for solving vehicle routing and truck driver scheduling problems. Eur. J. Oper. Res. 283(1):108–124.Crossref, Google Scholar
• Tilk C , Irnich S (2017) Dynamic programming for the minimum tour duration problem. Transportation Sci. 51(2):549–565.Link, Google Scholar
• Tompkins JA , White JA , Bozer YA , Tanchoco J (2010) Facilities Planning (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Tsai C-Y , Liou JJ , Huang T-M (2008) Using a multiple-GA method to solve the batch picking problem: Considering travel distance and order due time. Internat. J. Production Res. 46(22):6533–6555.Crossref, Google Scholar
• Van den Bergh J , Beliën J , de Bruecker P , Demeulemeester E , De Boeck L (2013) Personnel scheduling: A literature review. Eur. J. Oper. Res. 226(3):367–385.Crossref, Google Scholar
• Van Gils T , Ramaekers K , Braekers K , Depaire B , Caris A (2018a) Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions. Internat. J. Production Econom. 197:243–261.Crossref, Google Scholar
• Van Gils T , Ramaekers K , Caris A , De Koster RB (2018b) Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review. Eur. J. Oper. Res. 267(1):1–15.Crossref, Google Scholar
• Vanderbeck F (2000) On Dantzig-Wolfe decomposition in integer programming and ways to perform branching in a branch-and-price algorithm. Oper. Res. 48(1):111–128.Link, Google Scholar