Hybrid procedure to determine optimal workforce without noise hazard exposure

Authors:
Sorawit Yaoyuenyong;Suebsak Nanthavanij
Affiliations:
Industrial Engineering Program, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani 12121, Thailand;Management Technology Program, Sirindhorn International Institute of Technology, Thammasat University, Pathum Thani 12121, Thailand
Venue:
Computers and Industrial Engineering
Year:
2006

Citing 6
Cited 0

Lower bounds and reduction procedures for the bin packing problem

Discrete Applied Mathematics - Combinatorial Optimization
Solving binary cutting stock problems by column generation and branch-and-bound

Computational Optimization and Applications
An improved lower bound for the bin packing problem

Discrete Applied Mathematics
BISON: a fast hybrid procedure for exactly solving the one-dimensional bin packing problem

Computers and Operations Research
New heuristics for one-dimensional bin-packing

Computers and Operations Research
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hearing loss is a major occupational health problem among industrial workers. Repetitive exposure to loud noise increases the risk of hearing loss. An administrative noise control such as job rotation can help to reduce workers' daily noise exposures. In a case where noise levels are excessively high, it is often necessary to assign additional workers to the current workforce to alleviate daily noise exposures that individual workers receive. This paper presents four solution algorithms (three approximations and one exact) to determine a minimum number of workers and their work assignments to attend noisy workstations without noise hazard exposure (that is, daily noise exposure does not exceed 90dBA). Then, a hybrid procedure which utilizes the four algorithms successively is proposed to improve the solution procedure. Based on a computational experiment on 300 test problems, it is found that the hybrid procedure outperforms all four algorithms (when utilized separately) and is able to find an optimal solution for 88% of the test problems.