Please use this identifier to cite or link to this item: https://hdl.handle.net/10316/4622
Title: Workforce planning in a lotsizing mail processing problem
Authors: Júdice, Joaquim 
Martins, Pedro 
Nunes, Jacinto 
Keywords: Workforce scheduling; Batching decision process; Mixed integer programming; Postal service
Issue Date: 2005
Citation: Computers & Operations Research. 32:11 (2005) 3031-3058
Abstract: The treatment of mail objects in a mail processing centre involves many operations, in particular sorting by destination. Out of the batching problem that we can identify in such a process, there are also staff planning concerns. In this paper, we analyse a treatment area (registered mail) belonging to a mail processing center, where mail objects are treated in a chain production process. The production quantities and the transfer amounts among machines are required to be determined along the daily work period. The objective is to minimize the costs with human resources needed in the process, linked with the lotsizing production plan, by matching staff to work requirements. This leads into a lotsizing and workforce problem, for which we propose an integer programming formulation. A case study of a particular treatment area is also discussed. The formulation is adjusted to the specific constraints of this case study and some computational results are included, considering average, small and high daily amounts of mail arrived to that particular treatment area.
URI: https://hdl.handle.net/10316/4622
DOI: 10.1016/j.cor.2004.04.011
Rights: openAccess
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais

Files in This Item:
File Description SizeFormat
file080aa325e7334dad8335c3729e613070.pdf330.43 kBAdobe PDFView/Open
Show full item record

SCOPUSTM   
Citations

18
checked on Oct 14, 2024

WEB OF SCIENCETM
Citations

12
checked on Oct 2, 2024

Page view(s) 20

723
checked on Oct 29, 2024

Download(s) 50

451
checked on Oct 29, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.