z-logo
open-access-imgOpen Access
Flow Shop Scheduling Problem with Four Machines N-Job for Minimizing Makespan
Author(s) -
Sayali Choudhari,
Ritu Khanna
Publication year - 2017
Publication title -
international journal of engineering research and technology
Language(s) - English
Resource type - Journals
ISSN - 2278-0181
DOI - 10.17577/ijertv6is020284
Subject(s) - job shop scheduling , flow shop scheduling , computer science , mathematical optimization , scheduling (production processes) , flow (mathematics) , mathematics , schedule , operating system , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here