A heuristic genetic algorithm for solving complex safety-based work assignment problems

International Journal of Industrial Engineering : Theory Applications and Practice

Volumn 12, Issue 1, 2005, Pages 45-57

  Kullpattaranirun, Tarathorn ^a   Nanthavanij, Suebsak ^a  

^a THAMMASAT UNIVERSITY   (Thailand)

Author keywords

Genetic algorithm; Noise exposure reduction; Noise hazard management; Work assignment problem; Worker workstation restriction

Indexed keywords

ACOUSTIC NOISE; COMPUTATION THEORY; HEURISTIC METHODS; MATHEMATICAL OPERATORS; NOISE ABATEMENT; PROBLEM SOLVING; RESPONSE TIME (COMPUTER SYSTEMS);

NOISE EXPOSURE REDUCTION; NOISE HAZARD MANAGEMENT; WORK ASSIGNMENT PROBLEMS; WORKER-WORKSTATION RESTRICTION;

GENETIC ALGORITHMS;

EID: 33746648734     PISSN: 10724761     EISSN: 1943670X     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Brown, E.C. and Sumichrast, R.T. (2001). CF-GGA: A Grouping Genetic Algorithm for the Cell Formation Problem. International Journal of Production Research, 39: 3651-3669.
2. th International Conference on Computers and Industrial Engineering, pp. 568-571.
3. Chu, C.H. and Tsai, C.C. (2001). A Heuristic Genetic Algorithm for Group Manufacturing Cells. Proceedings of the 2001 Congress on Evolutionary Computation, Vol. 1, pp. 310-317.
4. Goldberg, D.E. (1989). Genetic Algorithms in Search. Optimization, and Machine Learning. Addison-Wesley, USA.
5. Goldberg, D.E. and Lingle, R. (1985). Alleles, Loci, and the Traveling Salesman Problem. Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 154-159.
6. Grefenstetts, J.J., Gopal, R., Rosmaita, B., and Van Gucht, D. (1985). Genetic Algorithms for the Traveling Salesman Problem. Proceedings of an International Conference on Genetic Algorithms and Their Applications, pp. 160-168.
7. Mak, K.L. and Wong, Y.S. (2000). Genetic Design of Cellular Manufacturing Systems. Human Factors and Ergonomics in Manufacturing. 10: 177-192.
8. Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs. Third, Revised, and Extended Edtion, Springer, USA.
9. th International Conference on Computers and Industrial Engineering, pp. 411-414.
10. Nanthavanij, S. and Kullpattaranirun, T. (2001). A Genetic Algorithm Approach to Determine Minimax Work Assignments. International Journal of Industrial Engineering, 8: 176-185.
11. th Annual International Conference on Industrial Engineering Theory, Applications and Practice, CD-ROM.
12. Occupational Safety and Health Administration (1983). Occupational Noise Exposure: Hearing Conservation Amendment. Federal Register, 48: 9738-9783.
13. Olsen, A. (1994). Penalty Functions and the Knapsack Problem. In Proceedings of the First IEEE Conference on Evolutionary Computation (Ed.: D. Fogel). IEEE Press, New Jersey, pp. 554-558.
14. th Edition, McGraw-Hill, USA.
15. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., and Whitley, C. (1991). A Comparison of Genetic Sequencing Operators. Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 69-76.
16. Tate, D. and Smith, A. (1995). A Genetic Approach to the Quadratic Assignment Problem. Computers and Operations Research, 22: 73-85.
17. Yang, R. (1997). Solving Large Travelling Salesman Problems with Small Populations. Proceedings of the Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications, pp. 157-162.