We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
Minimizing total flow time for the worker assignment scheduling problem in the identical parallel-machine models.
- Authors
Hu, Po-Chieng
- Abstract
The worker assignment scheduling problem consists of two basic questions of job scheduling and worker assignment. In this study, only the performance measure of total flow time is investigated in the model of identical parallel-machine with nonpreemptive jobs. Because the worker assignment scheduling problem in this specific model can be shown as NP-complete, heuristics have been developed for minimizing the total flow time. This selected worker assignment scheduling problem is solved in two stages of job scheduling and worker assignment. The shortest processing time for Ai part (SPT-A) heuristic is used for the stage of job scheduling. For the stage of worker assignment, the largest marginal contribution (LMC) procedure is used to minimize the total flow time. Two 100 I/P/n/m/W problems were simulated; results obtained by the heuristics are either optimal or near optimal. In conclusion, the heuristics developed have shown very impressive results quite efficiently.
- Subjects
OPERATIONS research; HEURISTIC; MACHINERY; PRODUCTION scheduling; PERFORMANCE evaluation; METHODOLOGY
- Publication
International Journal of Advanced Manufacturing Technology, 2005, Vol 25, Issue 9/10, p1046
- ISSN
0268-3768
- Publication type
Article
- DOI
10.1007/s00170-003-1989-z