The Optimal Number of Workers for Job Rotation to Prevent Workers from Occupational Hazards

K. Asawarungsaengkul, Naritsak Tuntitippawan
{"title":"The Optimal Number of Workers for Job Rotation to Prevent Workers from Occupational Hazards","authors":"K. Asawarungsaengkul, Naritsak Tuntitippawan","doi":"10.1109/RI2C48728.2019.8999881","DOIUrl":null,"url":null,"abstract":"This paper focuses on the application of administrative control which utilizes the job rotation to prevent workers from occupational hazards at the workplace. In the unsafe workplace, workers in the job rotation program will be assigned to workstations with low or high occupational hazards so that 8-hour exposure to each hazard of all workers will not exceed the permissible exposure limits. When dealing with a high hazard level, the number of workers required for job rotation is possibly more than the number of workstations because some workers in some periods will be assigned to perform tasks in the safe areas. Therefore, this paper proposes the optimization approach to solve the mixed-integer programming models that try to minimize the number of workers used in job rotation under noise hazard and air contamination. The numerical experiments are provided to demonstrate the solution procedures. Finally, the effectiveness of the branch and cut search in an optimization software namely CPLEX is also discussed. Within the computational limit, CPLEX can determine the optimal solutions for small size problems and the feasible solutions for large size problems.","PeriodicalId":404700,"journal":{"name":"2019 Research, Invention, and Innovation Congress (RI2C)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Research, Invention, and Innovation Congress (RI2C)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RI2C48728.2019.8999881","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper focuses on the application of administrative control which utilizes the job rotation to prevent workers from occupational hazards at the workplace. In the unsafe workplace, workers in the job rotation program will be assigned to workstations with low or high occupational hazards so that 8-hour exposure to each hazard of all workers will not exceed the permissible exposure limits. When dealing with a high hazard level, the number of workers required for job rotation is possibly more than the number of workstations because some workers in some periods will be assigned to perform tasks in the safe areas. Therefore, this paper proposes the optimization approach to solve the mixed-integer programming models that try to minimize the number of workers used in job rotation under noise hazard and air contamination. The numerical experiments are provided to demonstrate the solution procedures. Finally, the effectiveness of the branch and cut search in an optimization software namely CPLEX is also discussed. Within the computational limit, CPLEX can determine the optimal solutions for small size problems and the feasible solutions for large size problems.
防止工人发生职业危害的最优轮岗人数
本文重点研究了行政控制的应用,即利用岗位轮岗来防止工人在工作场所发生职业危害。在不安全的工作场所,工作轮岗计划中的工人将被分配到低或高职业危害的工作站,以便所有工人在8小时内接触每种危害不超过允许的暴露限值。当处理高危险级别时,工作轮岗所需的工人数量可能超过工作站的数量,因为在某些时期会有一些工人被分配到安全区域执行任务。因此,本文提出了一种求解混合整数规划模型的优化方法,该模型在噪声危害和空气污染的情况下,尽量减少轮岗工人的数量。通过数值实验验证了求解过程。最后,讨论了优化软件CPLEX中分支搜索和切割搜索的有效性。在计算限制内,CPLEX可以确定小尺寸问题的最优解和大尺寸问题的可行解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信