Abstract
In general, the hybrid flow shop problem HFSP is complex in nature. This papers deals with the effect of grouping technique in a multi-stage HFSP with practical relevance. With respect to increase in stages of HSFP, the level of complexity in solving the problem is increased. This paper deals with the problem which is motivated by practical need for operational scheduling in automobile spares manufacturing industry. The venture of this attempt is throughput related, i.e., minimising makespan. The simulation algorithms were used to find answers of many 'what if?' questions. The parameters included in this problem are queue length, mean lead time, machine utilisation to optimise the manufacturing strategy. In this problem, queue discipline was considered by applying first-in-first-out FIFO at all stages. The proposed group schedule yielded minimum makespan, acceptable queue length and significantly improved machine utilisation in the real-time examination.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Computing Science and Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
