Jump to content

Flow Shop Scheduling problems

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Lockley (talk | contribs) at 16:51, 10 October 2012 (Added tags to the page using Page Curation (unreferenced)). 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)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Flow Shop Scheduling problems" – news · newspapers · books · scholar · JSTOR (October 2012) (Learn how and when to remove this message)

Flow Shop Scheduling problem refers to special case of Job Shop Scheduling where there is strict order of all operations to be performed on all job.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Flow_Shop_Scheduling_problems&oldid=517030456"

Scheduling (computing)

Hidden categories: