Workforce planning in a lotsizing mail processing problem [An article from: Computers and Operations Research] | ![Workforce planning in a lotsizing mail processing problem [An article from: Computers and Operations Research]](http://ecx.images-amazon.com/images/I/41SS7GZHX6L._SL160_.jpg)
 enlarge | Authors: J. Judice, P. Martins, J. Nunes
Publisher: Elsevier
Category: Book
Buy New: $5.95
Format: Html
Media: Digital
Availability: Available for download now
| |
| Editorial Reviews:
Product Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in . The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.
Description:
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.
|
|
|
