On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm
Existing on-line order batching rules, namely fixed time window batching (FTWB) and variable time window batching (VTWB), try to choose the fixed time window in the case of FTWB or the fixed number of orders in the case of VTWB. However, these solutions are not appropriate for the fluctuating order...
Saved in:
| Published in: | Applied Mathematical Modelling Vol. 45; pp. 271 - 284 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York
Elsevier BV
01.05.2017
|
| Subjects: | |
| ISSN: | 0307-904X, 1088-8691, 0307-904X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Existing on-line order batching rules, namely fixed time window batching (FTWB) and variable time window batching (VTWB), try to choose the fixed time window in the case of FTWB or the fixed number of orders in the case of VTWB. However, these solutions are not appropriate for the fluctuating order environment. The reasonable assignment of batches to order pickers is also an important issue in order picking systems. Motivated by these issues, we study the problem of integrating on-line order batching and the assignment of the batches, which is called the on-line order batching and sequencing problem with multiple pickers (OOBSPMP). The objective is to minimize the turnover time. To solve the problem, a hybrid rule-based algorithm, referred to FTWB, is proposed in order to form batches and assign them to appropriate pickers under a fluctuating order environment. Three batching situations (off-peak, normal and peak arrival time) and two assigning situations (assigning to one busy picker and assigning to one idle picker) are distinguished. Through a series of experiments, we discover several enlightening findings: (i) the rule-based algorithm demonstrates high effectiveness and efficiency in turnover time with multiple pickers; (ii) the rule-based algorithm leads to an impressive improvement in both saving time and wage costs under different arrival rates, picking devices and time intervals compared with VTWB; (iii) to obtain both good warehouse performance and a reasonable workload distribution, the factors, such as the fixed time window, the average workload per picker and the average idle time per picker are also important issues in analysing the efficiency of order picking systems. |
|---|---|
| AbstractList | Existing on-line order batching rules, namely fixed time window batching (FTWB) and variable time window batching (VTWB), try to choose the fixed time window in the case of FTWB or the fixed number of orders in the case of VTWB. However, these solutions are not appropriate for the fluctuating order environment. The reasonable assignment of batches to order pickers is also an important issue in order picking systems. Motivated by these issues, we study the problem of integrating on-line order batching and the assignment of the batches, which is called the on-line order batching and sequencing problem with multiple pickers (OOBSPMP). The objective is to minimize the turnover time. To solve the problem, a hybrid rule-based algorithm, referred to FTWB, is proposed in order to form batches and assign them to appropriate pickers under a fluctuating order environment. Three batching situations (off-peak, normal and peak arrival time) and two assigning situations (assigning to one busy picker and assigning to one idle picker) are distinguished. Through a series of experiments, we discover several enlightening findings: (i) the rule-based algorithm demonstrates high effectiveness and efficiency in turnover time with multiple pickers; (ii) the rule-based algorithm leads to an impressive improvement in both saving time and wage costs under different arrival rates, picking devices and time intervals compared with VTWB; (iii) to obtain both good warehouse performance and a reasonable workload distribution, the factors, such as the fixed time window, the average workload per picker and the average idle time per picker are also important issues in analysing the efficiency of order picking systems. |
| Author | Chan, Felix T.S. Ruan, Junhu Zhang, Jun Wang, Xuping |
| Author_xml | – sequence: 1 givenname: Jun surname: Zhang fullname: Zhang, Jun – sequence: 2 givenname: Xuping surname: Wang fullname: Wang, Xuping – sequence: 3 givenname: Felix T.S. surname: Chan fullname: Chan, Felix T.S. – sequence: 4 givenname: Junhu surname: Ruan fullname: Ruan, Junhu |
| BookMark | eNp9kEtLAzEUhYNUsFZ_gLuA6xmTzEyncVeKLyh0o-Au5HHTps5kxmQG6b83pS7Ehat7Lpxz7-G7RBPfeUDohpKcEjq_2-eyb3OWZE5ZTig7Q1NSkDrjpHyf_NIX6DLGPSGkStsUqY3PGucBd8FAwEoOeuf8FktvcITPEbw-rn3oVAMt_nLDDrdjM7i-Adw7_QEh3uMl3h1UcAaHsYFMyQgGy2bbhWRvr9C5lU2E6585Q2-PD6-r52y9eXpZLdeZZnUxZEZyrSzVzHJOqDTVHKg2hSVKV7zgtqxZsVDVgltm5wC8qjQtq9LUFhSYghUzdHu6m8qm4nEQ-24MPr0UlBeMckpLnlz1yaVDF2MAK7Qb5OA6PwTpGkGJOAIVe5GAiiNQQZlIQFOS_kn2wbUyHP7JfAPtEH3B |
| CitedBy_id | crossref_primary_10_1016_j_ejor_2021_09_031 crossref_primary_10_1016_j_eswa_2021_115943 crossref_primary_10_1016_j_cie_2021_107823 crossref_primary_10_1007_s00500_025_10495_1 crossref_primary_10_1080_17509653_2021_1991852 crossref_primary_10_1016_j_jii_2022_100414 crossref_primary_10_1109_MRA_2023_3265515 crossref_primary_10_3233_JIFS_201690 crossref_primary_10_1016_j_cor_2020_105168 crossref_primary_10_1080_17517575_2024_2448832 crossref_primary_10_1080_00207543_2020_1766712 crossref_primary_10_1080_23302674_2025_2495324 crossref_primary_10_1016_j_ifacol_2024_09_084 crossref_primary_10_1155_2021_8863391 crossref_primary_10_1016_j_cie_2024_110767 crossref_primary_10_1016_j_tre_2025_104082 crossref_primary_10_1080_00207543_2023_2263884 crossref_primary_10_1016_j_cor_2021_105556 crossref_primary_10_3390_app112210641 crossref_primary_10_1016_j_jmsy_2022_08_006 crossref_primary_10_3390_pr9061061 crossref_primary_10_1007_s12652_018_1137_0 crossref_primary_10_1080_00207543_2023_2260896 crossref_primary_10_1109_TASE_2024_3428541 crossref_primary_10_1111_itor_12926 crossref_primary_10_3390_math11071684 crossref_primary_10_1007_s10489_020_01843_9 crossref_primary_10_1007_s12351_023_00814_5 crossref_primary_10_3390_rs14236106 crossref_primary_10_1016_j_cie_2023_109228 crossref_primary_10_1016_j_clscn_2022_100050 crossref_primary_10_1111_poms_14051 crossref_primary_10_1016_j_jksues_2019_02_004 crossref_primary_10_1016_j_cie_2024_110175 crossref_primary_10_1016_j_ejor_2020_03_075 crossref_primary_10_1016_j_ijpe_2017_04_002 crossref_primary_10_1007_s13748_020_00215_1 crossref_primary_10_1016_j_ejor_2019_03_012 crossref_primary_10_1109_TASE_2024_3477982 crossref_primary_10_1080_23302674_2023_2228447 crossref_primary_10_1002_net_22281 crossref_primary_10_1007_s10696_022_09445_y crossref_primary_10_1016_j_cie_2022_108026 crossref_primary_10_1016_j_ejor_2023_02_019 crossref_primary_10_1080_01605682_2023_2283526 crossref_primary_10_1016_j_ejor_2018_08_023 crossref_primary_10_1007_s10845_020_01653_3 crossref_primary_10_1016_j_ejor_2017_09_002 crossref_primary_10_1080_00207543_2021_1961037 crossref_primary_10_1080_00207543_2022_2078747 crossref_primary_10_1016_j_cie_2021_107517 crossref_primary_10_1080_00207543_2022_2053223 crossref_primary_10_3390_su10113931 crossref_primary_10_1016_j_tre_2024_103631 crossref_primary_10_3233_JIFS_182527 crossref_primary_10_1016_j_cie_2023_109180 crossref_primary_10_1007_s10898_020_00910_2 crossref_primary_10_1016_j_jmse_2023_11_004 crossref_primary_10_1155_2021_6673079 |
| Cites_doi | 10.1002/j.1538-7305.1966.tb01709.x 10.1016/0377-2217(92)90235-2 10.1016/S0377-2217(97)00416-5 10.1080/00207543.2013.849009 10.1080/07408179308964306 10.1016/j.cie.2016.02.001 10.1108/JMTM-03-2012-0036 10.1016/S0307-904X(99)00009-8 10.1080/002075499191094 10.1016/j.cor.2016.01.020 10.1016/j.eswa.2010.08.058 10.1287/opre.12.4.568 10.1016/j.ijpe.2011.02.006 10.2514/8.155 10.1080/07408170590516917 10.1007/s10696-011-9101-8 10.1016/j.ins.2016.07.014 10.1016/j.apm.2012.09.057 10.1016/j.apm.2016.01.004 10.1016/j.cie.2016.03.009 10.1080/00207543.2014.919424 10.1016/j.compind.2004.06.001 10.1007/BF03342717 10.1016/j.ejor.2012.03.045 10.1007/s10696-012-9164-1 10.1016/j.ijpe.2009.01.013 10.1287/mnsc.45.4.575 10.1016/j.ejor.2005.03.052 10.1016/j.cor.2011.12.019 10.1016/j.apm.2015.03.052 10.1016/j.ejor.2013.06.001 10.1016/j.ejor.2006.07.009 10.1080/00207543.2016.1174344 10.1016/j.omega.2004.05.003 10.1080/00207540701441947 10.1080/00207540600558015 10.1016/j.ejor.2012.05.049 10.1287/opre.31.3.507 |
| ContentType | Journal Article |
| Copyright | Copyright Elsevier BV May 2017 |
| Copyright_xml | – notice: Copyright Elsevier BV May 2017 |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.apm.2016.12.012 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Psychology |
| EISSN | 0307-904X |
| EndPage | 284 |
| ExternalDocumentID | 10_1016_j_apm_2016_12_012 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9DU 9JN AAEDT AAEDW AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AATTM AAXKI AAXUO AAYWO AAYXX ABAOU ABEFU ABFNM ABJNI ABMAC ABWVN ABXDB ACDAQ ACGFS ACLOT ACNNM ACRLP ACRPL ACVFH ADBBV ADCNI ADEZE ADMUD ADNMO ADTZH ADVLN AEBSH AECPX AEIPS AEKER AENEX AEUPX AEXQZ AFFNX AFJKZ AFPUW AFTJW AGHFR AGQPQ AGUBO AGYEJ AHHHB AHJVU AIEXJ AIGII AIGVJ AIIUN AIKHN AITUG AKBMS AKRWK AKYEP ALMA_UNASSIGNED_HOLDINGS AMRAJ ANKPU APXCP ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CITATION CS3 EBS EFJIC EFKBS EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FGOYB FIRID FNPLU FYGXN G-2 G-Q GBLVA HZ~ IHE IXB J1W JJJVA KOM LG9 LY7 M26 M41 MHUIS MO0 MVM N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- ROL RPZ SDF SDG SES SEW SPC SPCBC SST SSW SSZ T5K TN5 WH7 WUQ XPP ZMT ~02 ~G- ~HD -W8 .7I .GO .QK 0BK 2DF 53G 6J9 7SC 8FD 8VB AAGDL AAGZJ AAHIA AAHSB AAMFJ AAMIU AAPUL AATTQ AAZMC ABCCY ABDBF ABFIM ABIVO ABLIJ ABPEM ABRYG ABTAI ABXUL ABXYU ABZLS ACGOD ACHQT ACTIO ACTOA ACUHS ADAHI ADCVX ADKVQ AECIN AEFOU AEGXH AEISY AEKEX AEMOZ AEMXT AEOZL AEPSL AEYOC AEZRU AFHDM AFRVT AGDLA AGMYJ AGRBW AHDZW AHQJS AIJEM AIYEW AJWEG AKBVH AKVCP ALQZU AVBZW AWYRJ BEJHT BLEHA BMOTO BOHLJ CCCUG CQ1 DGFLZ DKSSO EAP EBR EBU EDJ EMK EPL EPS EST ESX E~B E~C FEDTE G-F GTTXZ H13 HF~ HVGLF J.O JQ2 K1G KYCEM L7M L~C L~D M4Z NA5 PQQKQ QWB RNANH ROSJB RSYQP S-F STATR TASJS TBQAZ TDBHL TEH TFH TFL TFW TH9 TNTFI TRJHH TUROJ TUS TWZ UPT UT5 UT9 VAE ZL0 ~01 ~S~ |
| ID | FETCH-LOGICAL-c273t-da9cbf1c2f9901ad56e1cd3f0bc5939f47238b589f2f6ee955c1454d7febed323 |
| ISICitedReferencesCount | 69 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000405445300019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0307-904X 1088-8691 |
| IngestDate | Wed Aug 13 06:03:25 EDT 2025 Tue Nov 18 21:18:58 EST 2025 Sat Nov 29 07:19:46 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c273t-da9cbf1c2f9901ad56e1cd3f0bc5939f47238b589f2f6ee955c1454d7febed323 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| PQID | 1932191149 |
| PQPubID | 2045280 |
| PageCount | 14 |
| ParticipantIDs | proquest_journals_1932191149 crossref_citationtrail_10_1016_j_apm_2016_12_012 crossref_primary_10_1016_j_apm_2016_12_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-05-00 20170501 |
| PublicationDateYYYYMMDD | 2017-05-01 |
| PublicationDate_xml | – month: 05 year: 2017 text: 2017-05-00 |
| PublicationDecade | 2010 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | Applied Mathematical Modelling |
| PublicationYear | 2017 |
| Publisher | Elsevier BV |
| Publisher_xml | – name: Elsevier BV |
| References | Van Nieuwenhuyse (10.1016/j.apm.2016.12.012_bib0033) 2009; 121 Grosse (10.1016/j.apm.2016.12.012_bib0008) 2015; 53 Hong (10.1016/j.apm.2016.12.012_bib0021) 2012; 221 Hsieh (10.1016/j.apm.2016.12.012_bib0029) 2011; 131 Wright (10.1016/j.apm.2016.12.012_bib0041) 1936; 3 Xu (10.1016/j.apm.2016.12.012_bib0032) 2014; 52 Atmaca (10.1016/j.apm.2016.12.012_bib0009) 2013; 37 Tsai (10.1016/j.apm.2016.12.012_bib0017) 2008; 46 Le-Duc (10.1016/j.apm.2016.12.012_bib0031) 2007; 176 Henn (10.1016/j.apm.2016.12.012_bib0026) 2015; 27 Lin (10.1016/j.apm.2016.12.012_bib0027) 2016; 95 Henn (10.1016/j.apm.2016.12.012_bib0034) 2012; 39 De Koster (10.1016/j.apm.2016.12.012_bib0003) 2007; 182 Gibson (10.1016/j.apm.2016.12.012_bib0011) 1992; 58 Menéndez (10.1016/j.apm.2016.12.012_bib0025) 2017; 78 Ho (10.1016/j.apm.2016.12.012_bib0012) 2006; 44 Koch (10.1016/j.apm.2016.12.012_bib0018) 2016; 86 De Koster (10.1016/j.apm.2016.12.012_bib0013) 1999; 37 Henn (10.1016/j.apm.2016.12.012_bib0023) 2012; 222 Zhang (10.1016/j.apm.2016.12.012_bib0035) 2016; 94 Clarke (10.1016/j.apm.2016.12.012_bib0014) 1964; 12 Huang (10.1016/j.apm.2016.12.012_bib0006) 2016; 40 Chew (10.1016/j.apm.2016.12.012_bib0030) 1999; 112 Ruan (10.1016/j.apm.2016.12.012_bib0004) 2016; 373 Chan (10.1016/j.apm.2016.12.012_bib0002) 2011; 38 Ruan (10.1016/j.apm.2016.12.012_bib0015) 2016; 54 Hsu (10.1016/j.apm.2016.12.012_bib0016) 2005; 56 Hall (10.1016/j.apm.2016.12.012_bib0038) 1993; 25 Chen (10.1016/j.apm.2016.12.012_bib0028) 2005; 33 Matusiak (10.1016/j.apm.2016.12.012_bib0019) 2014; 236 Graham (10.1016/j.apm.2016.12.012_bib0039) 1966; 45 Gademann (10.1016/j.apm.2016.12.012_bib0010) 2005; 37 Ruben (10.1016/j.apm.2016.12.012_bib0036) 1999; 45 Grosse (10.1016/j.apm.2016.12.012_bib0020) 2014; 20 Grosse (10.1016/j.apm.2016.12.012_bib0007) 2016 Kulak (10.1016/j.apm.2016.12.012_bib0024) 2012; 24 Grosse (10.1016/j.apm.2016.12.012_bib0040) 2013; 24 Malmborg (10.1016/j.apm.2016.12.012_bib0001) 2000; 24 Ratliff (10.1016/j.apm.2016.12.012_bib0037) 1983; 31 Henn (10.1016/j.apm.2016.12.012_bib0022) 2014; 3 Rostami (10.1016/j.apm.2016.12.012_bib0005) 2015; 39 |
| References_xml | – volume: 45 start-page: 1563 issue: 9 year: 1966 ident: 10.1016/j.apm.2016.12.012_bib0039 article-title: Bounds for certain multiprocessing anomalies publication-title: Bell Syst. Tech. J. doi: 10.1002/j.1538-7305.1966.tb01709.x – volume: 58 start-page: 57 issue: 1 year: 1992 ident: 10.1016/j.apm.2016.12.012_bib0011 article-title: Order batching procedures publication-title: Eur. J. Oper. Res. doi: 10.1016/0377-2217(92)90235-2 – volume: 112 start-page: 582 issue: 3 year: 1999 ident: 10.1016/j.apm.2016.12.012_bib0030 article-title: Travel time analysis for general item location assignment in a rectangular warehouse publication-title: Eur. J. Oper. Res. doi: 10.1016/S0377-2217(97)00416-5 – volume: 20 start-page: 65 issue: 2 year: 2014 ident: 10.1016/j.apm.2016.12.012_bib0020 article-title: A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions publication-title: Int. J. Oper. Quant. Manag. – volume: 52 start-page: 2232 issue: 8 year: 2014 ident: 10.1016/j.apm.2016.12.012_bib0032 article-title: Evaluating order throughput time with variable time window batching publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2013.849009 – volume: 25 start-page: 76 issue: 4 year: 1993 ident: 10.1016/j.apm.2016.12.012_bib0038 article-title: Distance approximations for routing manual pickers in a warehouse publication-title: IIE Trans. doi: 10.1080/07408179308964306 – volume: 94 start-page: 280 issue: 4 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0035 article-title: Integrated on-line scheduling of order batching and delivery under B2C e-commerce publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.02.001 – volume: 24 start-page: 850 issue: 6 year: 2013 ident: 10.1016/j.apm.2016.12.012_bib0040 article-title: An experimental investigation of learning effects in order picking systems publication-title: J. Manuf. Technol. Manag. doi: 10.1108/JMTM-03-2012-0036 – volume: 24 start-page: 95 issue: 2 year: 2000 ident: 10.1016/j.apm.2016.12.012_bib0001 article-title: An integrated performance model for order picking systems with randomized storage publication-title: Appl. Math. Model. doi: 10.1016/S0307-904X(99)00009-8 – volume: 37 start-page: 1479 issue: 7 year: 1999 ident: 10.1016/j.apm.2016.12.012_bib0013 article-title: Efficient order batching methods in warehouses publication-title: Int. J. Prod. Res. doi: 10.1080/002075499191094 – volume: 78 start-page: 500 issue: 2 year: 2017 ident: 10.1016/j.apm.2016.12.012_bib0025 article-title: Variable neighborhood search strategies for the order batching problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2016.01.020 – volume: 38 start-page: 2686 issue: 3 year: 2011 ident: 10.1016/j.apm.2016.12.012_bib0002 article-title: Improving the productivity of order picking of a manual-pick and multi-level rack distribution warehouse through the implementation of class-based storage publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2010.08.058 – volume: 12 start-page: 568 issue: 4 year: 1964 ident: 10.1016/j.apm.2016.12.012_bib0014 article-title: Scheduling of vehicles from a central depot to a number of delivery points publication-title: Oper. Res. doi: 10.1287/opre.12.4.568 – volume: 131 start-page: 618 issue: 2 year: 2011 ident: 10.1016/j.apm.2016.12.012_bib0029 article-title: New batch construction heuristics to optimise the performance of order picking systems publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2011.02.006 – volume: 3 start-page: 122 issue: 4 year: 1936 ident: 10.1016/j.apm.2016.12.012_bib0041 article-title: Factors affecting the cost of airplanes publication-title: J. Aeronaut. Sci. doi: 10.2514/8.155 – volume: 37 start-page: 63 issue: 1 year: 2005 ident: 10.1016/j.apm.2016.12.012_bib0010 article-title: Order batching to minimize total travel time in a parallel-aisle warehouse publication-title: IIE Trans. doi: 10.1080/07408170590516917 – volume: 24 start-page: 52 issue: 1 year: 2012 ident: 10.1016/j.apm.2016.12.012_bib0024 article-title: Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms publication-title: Flex. Serv. Manuf. J. doi: 10.1007/s10696-011-9101-8 – volume: 373 start-page: 557 issue: 10 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0004 article-title: Monitoring and assessing fruit freshness in IOT-based e-commerce delivery using scenario analysis and interval number approaches publication-title: Inf. Sci. doi: 10.1016/j.ins.2016.07.014 – volume: 37 start-page: 5069 issue: 7 year: 2013 ident: 10.1016/j.apm.2016.12.012_bib0009 article-title: Defining order picking policy: a storage assignment model and a simulated annealing solution in AS/RS systems publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2012.09.057 – volume: 40 start-page: 5482 issue: 9–10 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0006 article-title: EOQ model with batch demand and planned backorders publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2016.01.004 – volume: 95 start-page: 164 issue: 5 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0027 article-title: Joint order batching and picker Manhattan routing problem publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2016.03.009 – volume: 53 start-page: 695 issue: 3 year: 2015 ident: 10.1016/j.apm.2016.12.012_bib0008 article-title: Incorporating human factors in order picking planning models: framework and research opportunities publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2014.919424 – volume: 56 start-page: 169 issue: 2 year: 2005 ident: 10.1016/j.apm.2016.12.012_bib0016 article-title: Batching orders in warehouses by minimizing travel distance with genetic algorithms publication-title: Comput. Ind. doi: 10.1016/j.compind.2004.06.001 – volume: 3 start-page: 82 issue: 1 year: 2014 ident: 10.1016/j.apm.2016.12.012_bib0022 article-title: Metaheuristics for the order batching problem in manual order picking systems publication-title: Bus. Res. doi: 10.1007/BF03342717 – volume: 221 start-page: 557 issue: 3 year: 2012 ident: 10.1016/j.apm.2016.12.012_bib0021 article-title: Batch picking in narrow-aisle order picking systems with consideration for picker blocking publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.03.045 – volume: 86 start-page: 131 issue: 1–2 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0018 article-title: A grouping genetic algorithm for the order batching problem in distribution warehouses publication-title: J. Bus. Econ. – volume: 27 start-page: 86 issue: 1 year: 2015 ident: 10.1016/j.apm.2016.12.012_bib0026 article-title: Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses publication-title: Flex. Serv. Manuf. J. doi: 10.1007/s10696-012-9164-1 – volume: 121 start-page: 654 issue: 2 year: 2009 ident: 10.1016/j.apm.2016.12.012_bib0033 article-title: Evaluating order throughput time in 2-block warehouses with time window batching publication-title: Int. J. Prod. Econ. doi: 10.1016/j.ijpe.2009.01.013 – volume: 45 start-page: 575 issue: 4 year: 1999 ident: 10.1016/j.apm.2016.12.012_bib0036 article-title: Batch construction heuristics and storage assignment strategies for walk/ride and pick systems publication-title: Manag. Sci. doi: 10.1287/mnsc.45.4.575 – volume: 176 start-page: 374 issue: 1 year: 2007 ident: 10.1016/j.apm.2016.12.012_bib0031 article-title: Travel time estimation and order batching in a 2-block warehouse publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2005.03.052 – volume: 39 start-page: 2549 issue: 11 year: 2012 ident: 10.1016/j.apm.2016.12.012_bib0034 article-title: Algorithms for on-line order batching in an order picking warehouse publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.12.019 – volume: 39 start-page: 4909 issue: 16 year: 2015 ident: 10.1016/j.apm.2016.12.012_bib0005 article-title: Minimizing maximum tardiness and delivery costs with batch delivery and job release times publication-title: Appl. Math. Model. doi: 10.1016/j.apm.2015.03.052 – volume: 236 start-page: 968 issue: 3 year: 2014 ident: 10.1016/j.apm.2016.12.012_bib0019 article-title: A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2013.06.001 – volume: 182 start-page: 481 issue: 2 year: 2007 ident: 10.1016/j.apm.2016.12.012_bib0003 article-title: Design and control of warehouse order picking: a literature review publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2006.07.009 – volume: 54 start-page: 4368 issue: 14 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0015 article-title: Optimizing the intermodal transportation of emergency medical supplies using balanced fuzzy clustering publication-title: Int. J. Prod. Res. doi: 10.1080/00207543.2016.1174344 – volume: 33 start-page: 333 issue: 4 year: 2005 ident: 10.1016/j.apm.2016.12.012_bib0028 article-title: An association-based clustering approach to order batching considering customer demand patterns publication-title: Omega Int. J. Manag. Sci. doi: 10.1016/j.omega.2004.05.003 – start-page: 1 year: 2016 ident: 10.1016/j.apm.2016.12.012_bib0007 article-title: Human factors in order picking: a content analysis of the literature publication-title: Int. J. Prod. Res. – volume: 46 start-page: 6533 issue: 22 year: 2008 ident: 10.1016/j.apm.2016.12.012_bib0017 article-title: Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time publication-title: Int. J. Prod. Res. doi: 10.1080/00207540701441947 – volume: 44 start-page: 3391 issue: 17 year: 2006 ident: 10.1016/j.apm.2016.12.012_bib0012 article-title: A study on order-batching methods of order-picking in a distribution centre with two cross-aisles publication-title: Int. J. Prod. Res. doi: 10.1080/00207540600558015 – volume: 222 start-page: 484 issue: 3 year: 2012 ident: 10.1016/j.apm.2016.12.012_bib0023 article-title: Tabu search heuristics for the order batching problem in manual order picking systems publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.05.049 – volume: 31 start-page: 507 issue: 3 year: 1983 ident: 10.1016/j.apm.2016.12.012_bib0037 article-title: Order-picking in a rectangular warehouse – a solvable case of the traveling salesman problem publication-title: Oper. Res. doi: 10.1287/opre.31.3.507 |
| SSID | ssj0005904 ssj0012860 |
| Score | 2.4725552 |
| Snippet | Existing on-line order batching rules, namely fixed time window batching (FTWB) and variable time window batching (VTWB), try to choose the fixed time window... |
| SourceID | proquest crossref |
| SourceType | Aggregation Database Enrichment Source Index Database |
| StartPage | 271 |
| SubjectTerms | Algorithms Order picking Order processing Sequences Turnover Windows (intervals) Workload |
| Title | On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm |
| URI | https://www.proquest.com/docview/1932191149 |
| Volume | 45 |
| WOSCitedRecordID | wos000405445300019&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 0307-904X dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0005904 issn: 0307-904X databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier – providerCode: PRVAWR databaseName: Taylor & Francis Journals Complete customDbUrl: eissn: 0307-904X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0012860 issn: 0307-904X databaseCode: TFW dateStart: 19970301 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKxsN4QDBAbIzJD4gHqkzNh5OYtwq1gml0CGUsb1FiO7RTyLK2mbo_g_-Yc2wnKUgTPPASRc6HWt8vd-fz_e4QesOpl2ciYPCJ80CGboRF_TywUtdPuR_6gctZ02wimM3COKZfBoOfhgtzWwRlGW42tPqvooYxELakzv6DuNuXwgCcg9DhCGKH418J_ry0GtexKao5zEDVzg0RUedNKwJ600hGxWHbrMJqIbMsVoquPr-TbK7hsi6EJY0dH6bF9-slPPCj79IaP_ZzWwBW0n1lg53CmMV-YPq0buF4qYfiuurdKfkOjUstisVmGLXO6tc61TyScl73gxVgANvUQBVBa1k033o6FxSdFfqqadeJ0GSuUWDRkUreNIraI31Nqzq3_GEBVDDi6iStZJ0B22-CvTpTe6va9uw8mV6cnSXRJI7eVjeWbEQmN-x1V5YHaNcJYLUFKjKaXnZZQ1QuX_UulRMqFrr5A2bXvMkf_O0HbPs922a_8WWiJ-ixXoTgsQLPUzQQ5T561AlwtY_2Wst49wxlGlO4wRQ2mMKAKdxhCmtMYYkpbDCFNabe4zFWiMIdonCLqOfoYjqJPny0dHMOi4HHu7Z4SlmW28zJ5c5qyokvbMbdfJQxQl2ae7KbXUZCmju5LwQlhNke8XiQg9rgruO-QDvldSleIswogbdkAhYbqZcTkvocrApxPdf1ScrIARqZqUuYrlwvG6gUiUlRvEpgthM524ntJDDbB-hd-0ilyrbcd_ORkUeiP-RVIhc2NngCHj28__IrtNch_QjtrJe1eI0estv1YrU8RrvjT5P49LhB0S8lUpqS |
| linkProvider | Taylor & Francis |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On-line+order+batching+and+sequencing+problem+with+multiple+pickers%3A+A+hybrid+rule-based+algorithm&rft.jtitle=Applied+Mathematical+Modelling&rft.au=Zhang%2C+Jun&rft.au=Wang%2C+Xuping&rft.au=Chan%2C+Felix+TS&rft.au=Ruan%2C+Junhu&rft.date=2017-05-01&rft.pub=Elsevier+BV&rft.issn=1088-8691&rft.eissn=0307-904X&rft.volume=45&rft.spage=271&rft_id=info:doi/10.1016%2Fj.apm.2016.12.012&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0307-904X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0307-904X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0307-904X&client=summon |