Flow-shop scheduling: Difference between revisions

Content deleted Content added
Formal definition: There are m machies and n jobs. And not n machines and m jobs. Because it makes no sense with the otherp art of the definition
The last job operation is the m-th operation, not n-th, since there are m operations in each job.
Line 9:
There are ''m'' machines and ''n'' jobs. Each job contains exactly ''m'' operations. The ''i''-th operation of the job must be executed on the ''i''-th machine. No machine can perform more than one operation simultaneously. For each operation of each job, execution time is specified.
 
Operations within one job must be performed in the specified order. The first operation gets executed on the first machine, then (as the first operation is finished) the second operation on the second machine, and so on until the ''nm''-th operation. Jobs can be executed in any order, however. Problem definition implies that this job order is exactly the same for each machine. The problem is to determine the optimal such arrangement, i.e. the one with the shortest possible total job execution makespan.
 
==Sequencing performance measurements (γ)==