The paper considers the flow shop scheduling problems to minimize the makespan, provided that an individual precedence relation is specified on each machine. A fairly complete complexity classification of problems with two and three machines is obtained.
Read full abstract- All Solutions
Editage
One platform for all researcher needs
Paperpal
AI-powered academic writing assistant
R Discovery
Your #1 AI companion for literature search
Mind the Graph
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus - Support
Paper
Cancel
Complexity Classification Of Problems Research Articles
Overview
1 Articles
Published in last 50 years
Related Topics
Articles published on Complexity Classification Of Problems
Journals
Select Journals
Duration
Select Duration
Mar 1, 2004
A.A Gladky + 2
