Jump to content

Flow-shop scheduling

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Shanttashjean (talk | contribs) at 05:14, 15 February 2009 (←Created page with '== Flow Shop Scheduling Problem == ---- Flow Shop Scheduling Problems, or '''FSP'''s, are a class of '''Group Shop Scheduling Problems''' in which the operations o...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Flow Shop Scheduling Problem

Flow Shop Scheduling Problems, or FSPs, are a class of Group Shop Scheduling Problems in which the operations of every job must be processed on machines 1,2,...,m in this same order. A special case of FSPs are Permutations Flow Shop Scheduling Problems, or PFSP, in which the processing order of the jobs on the machines is the same for every machine.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Flow-shop_scheduling&oldid=270822544"