Rate the Article: A New Approach to the Permutation Flow Shop Scheduling, IJSR, Call for Papers, Online Journal
International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 113 | Views: 362

Research Paper | Mechanical Engineering | India | Volume 2 Issue 4, April 2013 | Rating: 6.8 / 10


A New Approach to the Permutation Flow Shop Scheduling

Kundeti Monesh Teja, Pallipogu Vijay


Abstract: In this project, the permutation flow shop scheduling problem is considered. One of the established methods for two machine scheduling problem is modified and extended to provide a solution for permutation flow of scheduling problem. The solution methodology consists of a square matrix (taking n jobs as rows and n machines as Column’s). The job sequence generated by applying the Johnson’s method in multi-stages. On processing time to minimize make span. Comparing the new method with other existing heuristic method like NEH method.


Keywords: Machining Time, Starting Time, Finishing Time. Flow Shop Scheduling, Heuristics, Make span


Edition: Volume 2 Issue 4, April 2013,


Pages: 573 - 579



Rate this Article


Select Rating (Lowest: 1, Highest: 10)

5

Your Comments (Only high quality comments will be accepted.)

Characters: 0

Your Full Name:


Your Valid Email Address:


Verification Code will appear in 2 Seconds ... Wait

Top