Advertisement
Published in:
2007 | OriginalPaper | Chapter
Flow Shop Scheduling
Published in: Handbook on Scheduling
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of
n
jobs, each of which is characterized by the same machine sequence. For convenience, let us assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout in the general case — handled in Chapter 10 — is the job shop; the particular case where each job is processed on a set of machines in the same order is the flow shop. The most commonly used performance measure will be makespan minimization.