Flow-shop scheduling: Difference between revisions

Revision as of 13:35, 28 December 2015

Revision as of 13:36, 28 December 2015

Line 4:

==Formal definition==

There are ''n'' machines and ''m'' jobs. Each job contains exactly ''n'' 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 until the ''n''-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 timespanmakespan. <ref>{{cite web | url=http://posh-wolf.herokuapp.com/problem | title=posh-wolf website | accessdate=28 December 2015}}</ref>

==Sequencing Performance Measurements (γ)==