Please use this identifier to cite or link to this item:
DC FieldValueLanguage
dc.contributor.authorJúdice, Joaquim-
dc.contributor.authorMartins, Pedro-
dc.contributor.authorNunes, Jacinto-
dc.identifier.citationComputers & Operations Research. 32:11 (2005) 3031-3058en_US
dc.description.abstractThe 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.en_US
dc.subjectWorkforce schedulingen_US
dc.subjectBatching decision processen_US
dc.subjectMixed integer programmingen_US
dc.subjectPostal serviceen_US
dc.titleWorkforce planning in a lotsizing mail processing problemen_US
item.fulltextCom Texto completo-
Appears in Collections:FCTUC Matemática - Artigos em Revistas Internacionais
Files in This Item:
File Description SizeFormat
file080aa325e7334dad8335c3729e613070.pdf330.43 kBAdobe PDFView/Open
Show simple item record

Page view(s) 20

checked on Sep 17, 2019

Download(s) 50

checked on Sep 17, 2019

Google ScholarTM


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