Abstract:Flow shop is a kind of job shop in which jobs have the similar process sequence. Flows shop scheduling problem (FSP) comes under NP (Non polynomial) hard category which means hardness of the problem will increase as much as the number of jobs increases. In FSP there will be a n! possible sequences can be formed if we take n as number of jobs. Everyday flow shop will receive different set of jobs, schedulers have to make decision as quick as possible. A wrong decision in FSP may result in huge loss to the organ… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.