| dc.creator |
Berman, Oded |
|
| dc.creator |
Larson, Richard C., 1943- |
|
| dc.date |
2004-05-28T19:34:38Z |
|
| dc.date |
2004-05-28T19:34:38Z |
|
| dc.date |
1994-02 |
|
| dc.date.accessioned |
2013-10-09T02:39:10Z |
|
| dc.date.available |
2013-10-09T02:39:10Z |
|
| dc.date.issued |
2013-10-09 |
|
| dc.identifier |
http://hdl.handle.net/1721.1/5341 |
|
| dc.identifier.uri |
http://koha.mediu.edu.my:8181/xmlui/handle/1721 |
|
| dc.description |
We define a service factory to be a network of service-related-workstations, at which assigned workers process work-in-progress that flows through the workstations. Examples of service factory work include mail processing and sorting, check processing and telephoned order processing. Exogenous work may enter the factory at any workstation according to any time-of-day profile. Work-in-progress flows though the factory in discrete time according to Markovian routings. Workers, who in general are cross trained, may work part time or full time shifts, may start work only at designated shift starting times, and may change job assignments at midshift. In order to smooth the flow of work-in-progress through the service factory, work-in-progress may be temporarily inventoried (in buffers) at work stations. The objective is to schedule the workers (and correspondingly, the workflow) in a manner that minimizes labor costs subject to a variety of service-level, contractural and physical constraints. Motivated in part by analysis techniques of discrete time linear time-invariant (LTI) systems, an object-oriented linear programming (OOLP) model is developed. Using exogenous input work profiles typical of large U. S. mail processingfacilities, illustrative computational results are included. |
|
| dc.format |
2364715 bytes |
|
| dc.format |
application/pdf |
|
| dc.language |
en_US |
|
| dc.publisher |
Massachusetts Institute of Technology, Operations Research Center |
|
| dc.relation |
Operations Research Center Working Paper;OR 287-94 |
|
| dc.subject |
Linear programming, scheduling, service, factory, object-oriented, queueing, queueing networks, Markov chains. |
|
| dc.title |
Scheduling Workforce and Workflow in a Service Factory |
|
| dc.type |
Working Paper |
|