A dynamic job-assignment policy
作者:
WE-MIN CHOW,
期刊:
International Journal of Production Research
(Taylor Available online 1988)
卷期:
Volume 26,
issue 6
页码: 1073-1087
ISSN:0020-7543
年代: 1988
DOI:10.1080/00207548808947919
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
Job assignment is a well-known problem in manufacturing lines. Line management tries to maximize line productivity by assigning a given crew a set of predefined line jobs. However, problems may arise because of abnormal conditions such as absenteeism, workstation failure, parts shortage, or unevenly distributed work-in-process. This report considers a dynamic job-assignment policy making use of online information for assignment. This policy attempts to achieve a good skill match between jobs and operators, and to eliminate unnecessary assignments. To fulfill this policy, a two-part assignment program is proposed: an algorithm for job matching and a set ofad hocrules. The matching algorithm is well established in literature, but thead hocrules are application-dependent. Discussion here concentrates on thead hocrules and online data collection.
点击下载:
PDF (437KB)
返 回