制造单元中机器集群的工人分配

S. Prombanpong, Waraporn Seenpipat
{"title":"制造单元中机器集群的工人分配","authors":"S. Prombanpong, Waraporn Seenpipat","doi":"10.1109/IEEM.2011.6117937","DOIUrl":null,"url":null,"abstract":"A worker assignment for machine cluster in the manufacturing cell was discussed in this paper. The objective of this paper is two folds. First, it aims to demonstrate a calculation of the maximum number of machines which one worker can optimally operate without an idle time on the machine. Then, the simulation software program is utilized to evaluate various proposed improvement alternatives based on maximum machine efficiency criteria. In this study one of the hard disk drive manufacturers in Thailand was explored. Previously, one worker was assigned to service eight semi-automated machines in the cluster. The main tasks of the worker were loading, checking and recording. Due to the fact that workload of the worker and the machine cycle is not balanced so the utilization of the worker cannot be maximized. Therefore, the optimum number of machines which one worker can ideally service is calculated. It is found that one worker can optimally serve up to eleven machines. However, other alternatives are also explored. As a result, by systematic work elimination, one worker can service up to fourteen machines per cycle with 96.09% machine utilization.","PeriodicalId":427457,"journal":{"name":"2011 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A worker assignment for machine cluster in the manufacturing cell\",\"authors\":\"S. Prombanpong, Waraporn Seenpipat\",\"doi\":\"10.1109/IEEM.2011.6117937\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A worker assignment for machine cluster in the manufacturing cell was discussed in this paper. The objective of this paper is two folds. First, it aims to demonstrate a calculation of the maximum number of machines which one worker can optimally operate without an idle time on the machine. Then, the simulation software program is utilized to evaluate various proposed improvement alternatives based on maximum machine efficiency criteria. In this study one of the hard disk drive manufacturers in Thailand was explored. Previously, one worker was assigned to service eight semi-automated machines in the cluster. The main tasks of the worker were loading, checking and recording. Due to the fact that workload of the worker and the machine cycle is not balanced so the utilization of the worker cannot be maximized. Therefore, the optimum number of machines which one worker can ideally service is calculated. It is found that one worker can optimally serve up to eleven machines. However, other alternatives are also explored. As a result, by systematic work elimination, one worker can service up to fourteen machines per cycle with 96.09% machine utilization.\",\"PeriodicalId\":427457,\"journal\":{\"name\":\"2011 IEEE International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2011.6117937\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2011.6117937","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

讨论了制造单元中机群的工人分配问题。本文的目的有两个方面。首先,它的目的是演示一个计算,一个工人可以在机器上没有空闲时间的情况下最佳地操作机器的最大数量。然后,利用仿真软件程序对基于最大机器效率标准提出的各种改进方案进行评估。本研究以泰国一家硬碟制造商为研究对象。在此之前,一名工人被分配到集群中的八台半自动机器。工人的主要工作是装载、检查和记录。由于工人的工作量和机器周期不平衡,所以工人的利用率不能最大化。因此,计算出一个工人可以理想地服务的机器的最优数量。结果发现,一个工人最多可以服务11台机器。然而,也在探索其他替代方案。因此,通过系统的工作消除,一个工人每个周期可以服务多达14台机器,机器利用率为96.09%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A worker assignment for machine cluster in the manufacturing cell
A worker assignment for machine cluster in the manufacturing cell was discussed in this paper. The objective of this paper is two folds. First, it aims to demonstrate a calculation of the maximum number of machines which one worker can optimally operate without an idle time on the machine. Then, the simulation software program is utilized to evaluate various proposed improvement alternatives based on maximum machine efficiency criteria. In this study one of the hard disk drive manufacturers in Thailand was explored. Previously, one worker was assigned to service eight semi-automated machines in the cluster. The main tasks of the worker were loading, checking and recording. Due to the fact that workload of the worker and the machine cycle is not balanced so the utilization of the worker cannot be maximized. Therefore, the optimum number of machines which one worker can ideally service is calculated. It is found that one worker can optimally serve up to eleven machines. However, other alternatives are also explored. As a result, by systematic work elimination, one worker can service up to fourteen machines per cycle with 96.09% machine utilization.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信