Multi-criteria M-machine SDST flow shop scheduling using modified heuristic genetic algorithm
by D. Satyanarayana; M. Pramiladevi
International Journal of Industrial and Systems Engineering (IJISE), Vol. 22, No. 4, 2016

Abstract: The multi-criteria flow shop scheduling problem with sequence dependent setup times (SDST) is one of the most difficult class of scheduling problems. Efficient supervision of heuristics with SDST is one of the significant features to enhance the performance of manufacturing system. In this work, we have formulated multi-criteria decision-making flow shop scheduling problem. It consists of weighted sum of total weighted squared tardiness, makespan, total weighted squared earliness and number of tardy jobs. It is a very effective decision-making for scheduling jobs in modern manufacturing environment. In the present work, three efficient special heuristics based hybrid genetic algorithms (i.e., SHGA1, SHGA2, and SHGA3) are proposed for multi-criteria SDST. Experiments are conducted on the benchmark problems (Taillard, 1993). The performance of three SHGAs are tested, analysed and compared with the help of a defined performance index, known as relative percentage deviation (RPD). The maximum size of the problem is limited to 100 jobs and ten machines. From the results and analysis, the performance of SHGA3 found to be the best.

Online publication date: Tue, 08-Mar-2016

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 Industrial and Systems Engineering (IJISE):
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