Optimisation of sequencing and scheduling in hybrid flow shop environment using heuristic approach Online publication date: Wed, 15-Dec-2010
by S. Sridhar, T. Prabaharan, M. Saravanan
International Journal of Logistics Economics and Globalisation (IJLEG), Vol. 2, No. 4, 2010
Abstract: This paper considers the hybrid flow shop scheduling problem. Most real world scheduling problems are NP-hard in nature. The main purpose of this paper is to present a new approach to the objective version of the well known hybrid flow shop problem. The processing of each job on each machine is an operation which requires the exclusive use of the machine for an uninterrupted duration called the processing time 't'. The objective of this paper is to find minimum makespan in a serial multiple-stage manufacturing system, where each stage consists of parallel identical machines. Generally processing of 'n' jobs by 'm' machines with 'k' stage is solved by Gantt chart method which gives an active feasible schedule. A simulated annealing algorithm is proposed in this paper to find a better/optimal or near optimal schedule. This technique reveals that the proposed algorithm is capable of providing better results than the company existing production results.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Logistics Economics and Globalisation (IJLEG):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook