Flow shop scheduling

From Wikipedia, the free encyclopedia
  (Redirected from Flow Shop Scheduling Problem)
Jump to: navigation, search

Flow shop scheduling problems, are a class of scheduling problems with a workshop or group shop in which the flow control shall enable an appropriate sequencing for each job and for processing on a set of machines or with other resources 1,2,...,m in compliance with given processing orders. Especially the maintaining of a continuous flow of processing tasks is desired with a minimum of idle time and a minimum of waiting time. Flow shop scheduling is a special case of job shop scheduling where there is strict order of all operations to be performed on all jobs. Flow shop scheduling may apply as well to production facilities as to computing designs.

A special type of flow shop scheduling problem is the permutation flow shop scheduling problem in which the processing order of the jobs on the resources is the same for each subsequent step of processing.

Sequencing Performance Measurements (γ)[edit]

The sequencing problem can be stated as determining a sequence S such that one or several sequencing objectives are optimized.

  1. (Average)Flow time, \sum (w_i) F_i
  2. Makespan,Cmax
  3. (Average) Tardiness, \sum (w_i) T_i
  4. ....

detailed discussion of performance measurement can be found in Malakooti (2013).

Complexity of flow shop scheduling[edit]

As presented by Garey et al. (1976), most of extensions of the flow shop scheduling problems are Np-Hard and few of them can be solved optimally in O(nlogn), for example F2|prmu|Cmax can be solved optimally by using Johnson's Rule.

Solution Methods[edit]

The proposed methods to solve flow shop scheduling problems can be classified to exact methods such as Branch and Bound and dynamic programming, Heuristic algorithms and metaheuristics.

Minimizing makespan,Cmax[edit]

F2|prmu|Cmax and F3|prmu|Cmax can be solved optimally by using Johnson's Rule (1954) but for general case there is no algorithm that grantee the optimality of the solution.
Here is minimization using Johnson's Rule
The flow shop contains n jobs simultaneously available at time zero and to be processed by two machines arranged in series with unlimited storage in between them. The processing time of all jobs are known with certainty. It is required to schedule n jobs on machines so as to minimize makespan. The Johnson's rule for scheduling jobs in two machine flow shop is given below: In an optimal schedule, job i precedes job j if min{pi1,pj2} < min{pj1,pi2}. Where as, pi1 is the processing time of job i on machine 1 and pi2 is the processing time of job i on machine 2. Similarly, pj1 and pj2 are processing times of job j on machine 1 and machine 2 respectively.
The steps are summarized below for Johnson's algorithms:
let, p1j=processing time of job j on machine 1
p2j=processing time of job j on machine 2
Johnson's Algorithm
Step 1:Form set1 containing all the jobs with p1j < p2j
Step 2:Form set2 containing all the jobs with p1j > p2j,the jobs with p1j=p2j may be put in either set.
Step 3: Form the sequence as follows:
i) The job in set1 go first in the sequence and they go in increasing order of p1j(SPT)
ii) The jobs in set2 follow in decreasing order of p2j (LPT). Ties are broken arbitrarily.
This type schedule is referred as SPT(1)-LPT(2) schedule.

Other objectives[edit]

So far, there is no algorithm which can guarantee optimal solution.

The detailed discussion of the available solution methods are provided by Malakooti (2013).

References[edit]

External links[edit]

  • Posh Wolf - online flow shop solver with real-time visualization