Title: Shuffled frog leaping algorithm approach to employee timetabling and job shop scheduling

Authors: G. Ramya; M. Chandrasekaran

Addresses: Department of Mechanical Engineering, Sathyabama University, Jeppiaar Nagar, Old Mamallapuram Road, Chennai, Tamilnadu, Pin Code: 600119, India ' Department of Mechanical Engineering, VELS University, Velan Nagar, P.V. Vaithiyalingam Road, Pallavaram, Chennai, Tamilnadu, Pin Code: 600117, India

Abstract: In manufacturing systems, generally employee timetabling and job shop scheduling is considered to be too hard and complex. To achieve an integrated manufacturing environment, the integration of employee timetabling and job shop scheduling is essential. It is a process of assigning employees into work slots in a pattern according to the hierarchy level of the employee, job allotment, individual preferences and knowledge skills. This paper proposes a framework model for integration between the two production functions with an objective of minimising labour costs based on employee availability constraint. At first, it provides a common time representation for employee timetabling and scheduling. Then, it provides the application of shuffled frog leaping algorithm used to find an optimum production schedule. An industrial case study also has been analysed for generation of employee timetabling and master production schedule. The result shows that the proposed system is unique for its features such as automatically constructing job sequence and employee work load.

Keywords: job shop scheduling; employee timetabling; integration; heuristics algorithm; shuffled frog leaping algorithm; SFLA; integrated manufacturing; optimisation; job sequences; case study; master production scheduling; MPS; employee workload.

DOI: 10.1504/IJIMS.2014.062443

International Journal of Internet Manufacturing and Services, 2014 Vol.3 No.3, pp.178 - 203

Received: 23 Mar 2013
Accepted: 27 Jan 2014

Published online: 30 Jun 2014 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article