Shuffled frog leaping algorithm approach to employee timetabling and job shop scheduling
by G. Ramya; M. Chandrasekaran
International Journal of Internet Manufacturing and Services (IJIMS), Vol. 3, No. 3, 2014

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.

Online publication date: Mon, 30-Jun-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Internet Manufacturing and Services (IJIMS):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com