2811. A Heuristic for Worker Assignment in Multi-stage Production Lines
Invited abstract in session WC-12: Workforce assignment, stream Scheduling and Project Management.
Wednesday, 12:30-14:00Room: Clarendon SR 1.02
Authors (first author is the speaker)
| 1. | Xiaowen ZHAO
|
| Department of Industrial and Systems Engineering, Aoyama Gakuin University | |
| 2. | Shao-Chin Sung
|
| Department of Industrial and Systems Engineering, Aoyama Gakuin University |
Abstract
We are dealing with a worker assignment problem in multi-stage production lines based on the so-called restricted-cycle model with multiple periods. Given each worker's early probability, expected earliness, and expected tardiness, the objective is to minimize the total expected cost, i.e., the sum of the total expected earliness cost and the total expected tardiness cost incurred at all stages, among all possible worker assignments to stages in the production line. In particular, the expected tardiness cost at each stage depends on the late completions at that stage and the number of consecutive late completions at earlier stages.
Previous studies propose branch-and-bound-based algorithms for finding optimal assignments. These algorithms have exponential running times with respect to the number of stages in the production line. To provide a solution method with practical running time, we propose a fast heuristic for finding a near-optimal assignment. The effectiveness of our heuristic is evaluated through numerical experiments.
Keywords
- Scheduling
- Combinatorial Optimization
- Algorithms
Status: accepted
Back to the list of papers