Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/30364
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | VANHEUSDEN, Sarah | - |
dc.contributor.author | VAN GILS, Teun | - |
dc.contributor.author | CARIS, An | - |
dc.contributor.author | RAMAEKERS, Katrien | - |
dc.contributor.author | BRAEKERS, Kris | - |
dc.date.accessioned | 2020-01-22T09:30:27Z | - |
dc.date.available | 2020-01-22T09:30:27Z | - |
dc.date.issued | 2020 | - |
dc.date.submitted | 2020-01-21T20:05:41Z | - |
dc.identifier.citation | Computers & Industrial Engineering, 141, (Art N° 106269) | - |
dc.identifier.issn | 0360-8352 | - |
dc.identifier.uri | http://hdl.handle.net/1942/30364 | - |
dc.description.abstract | A growing e-commerce market and increasing customer requirements put extra pressure on order picking operations. Collecting large quantities of relative small orders within limited time windows makes workload balancing in order picking a challenging and complicated task. Therefore, warehouse managers experience difficulties in balancing the daily workload of order pickers in every pick zone. This paper introduces the operational workload balancing problem within the domain of order picking. A mathematical model is introduced to describe the new order picking planning problem. Furthermore, an iterated local search algorithm is developed to solve the operational workload balancing problem efficiently and effectively. The benefits of daily workload balancing in order picking operations are analysed by means of a real-life case. | - |
dc.description.sponsorship | This work is supported by the Strategic Basic Research project Datadriven logistics (S007318N), funded by the Research Foundation Flanders (FWO). The computational resources and services used in this work were provided by the VSC (Flemish Supercomputer Center), funded by the Research Foundation - Flanders (FWO) and the Flemish Government department EWI. | - |
dc.language.iso | en | - |
dc.publisher | Elsevier | - |
dc.rights | 2020 Published by Elsevier Ltd. | - |
dc.subject.other | warehouse management | - |
dc.subject.other | workload balancing | - |
dc.subject.other | zone picking | - |
dc.subject.other | meta-heuristic | - |
dc.title | Operational Workload Balancing in Manual Order Picking | - |
dc.type | Journal Contribution | - |
dc.identifier.volume | 141 | - |
local.bibliographicCitation.jcat | A1 | - |
local.publisher.place | THE BOULEVARD, LANGFORD LANE, KIDLINGTON, OXFORD OX5 1GB, ENGLAND | - |
local.type.refereed | Refereed | - |
local.type.specified | Article | - |
local.bibliographicCitation.artnr | 106269 | - |
local.type.programme | VSC | - |
dc.identifier.doi | 10.1016/j.cie.2020.106269 | - |
dc.identifier.isi | WOS:000517654200015 | - |
dc.identifier.eissn | 1879-0550 | - |
local.provider.type | CrossRef | - |
local.uhasselt.uhpub | yes | - |
local.uhasselt.international | no | - |
item.validation | ecoom 2021 | - |
item.fulltext | With Fulltext | - |
item.accessRights | Open Access | - |
item.fullcitation | VANHEUSDEN, Sarah; VAN GILS, Teun; CARIS, An; RAMAEKERS, Katrien & BRAEKERS, Kris (2020) Operational Workload Balancing in Manual Order Picking. In: Computers & Industrial Engineering, 141, (Art N° 106269). | - |
item.contributor | VANHEUSDEN, Sarah | - |
item.contributor | VAN GILS, Teun | - |
item.contributor | CARIS, An | - |
item.contributor | RAMAEKERS, Katrien | - |
item.contributor | BRAEKERS, Kris | - |
crisitem.journal.issn | 0360-8352 | - |
crisitem.journal.eissn | 1879-0550 | - |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
1-s2.0-S0360835220300036-main.pdf Restricted Access | Published version | 2.78 MB | Adobe PDF | View/Open Request a copy |
OWBP CIE.pdf | Peer-reviewed author version | 1.15 MB | Adobe PDF | View/Open |
WEB OF SCIENCETM
Citations
20
checked on May 1, 2024
Page view(s)
184
checked on Sep 7, 2022
Download(s)
36
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.