Flow-shop scheduling: Difference between revisions

Revision as of 03:45, 19 June 2021

Latest revision as of 06:52, 19 April 2025

(11 intermediate revisions by 8 users not shown)

Line 1:

{{shortShort description|classClass of computational problem}}

{{citation style|date=May 2016}}

[[File:Flow Shop Ordonnancement.JPEG|thumb|Flow Shop Ordonnancement]]

{{short description|class of computational problem}}

'''Flow -shop scheduling''' is an [[optimization problem]] in [[computer science]] and [[Operations Research|operations research]]. It is a variant of [[optimal job scheduling]]. In a general job -scheduling problem, we are given ''n'' jobs ''J''₁, ''J''₂, ..., ''J_n'' of varying processing times, which need to be scheduled on ''m'' machines with varying processing power, while trying to minimize the [[makespan]] -– the total length of the schedule (that is, when all the jobs have finished processing). In the specific variant known as ''flow-shop scheduling'', 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.

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 [[Manufacturing|production]] facilities as to [[computing]] designs. A special type of flow -shop scheduling problem is the '''permutation flow -shop scheduling''' problem in which the [[Process (engineering)|processing]] order of the jobs on the resources is the same for each subsequent step of processing.

In the standard [[Optimal job scheduling|three-field notation for optimal -job -scheduling problems]], the flow-shop variant is denoted by '''F''' in the first field. For example, the problem denoted by " '''F3|<math>p_{ij}</math>|'''<math>C_\max</math>" is a 3-machines flow -shop problem with unit processing times, where the goal is to minimize the maximum completion time.

==Formal definition==

There are ''nm'' machines and ''mn'' 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.<ref>{{cite web | url=http://posh-wolf.herokuapp.com/problem | title=posh-wolf website | accessdate=28 December 2015}}</ref>

==Sequencing performance measurements (γ)==

Line 18:

# (Average) Tardiness, <math>\sum (w_i) T_i </math>

# ....

detailed discussion of performance measurement can be found in [[Behnam Malakooti|Malakooti]](2013).<ref name=Malakooti>Malakooti, B (2013). Operations and Production Systems with Multiple Objectives. John Wiley & Sons. {{ISBN|978-1-118-58537-5}}.</ref>

==Complexity of flow -shop scheduling==

As presented by Garey et al. (1976),<ref name=Garey>{{cite journal

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|C_max can be solved optimally by using [[Johnson's Rule]].

| last1=Garey | first1=M. R.

| last2=Johnson | first2=D. S.

| last3=Sethi | first3=Ravi

| date=1976

| title=The complexity of flowshop and jobshop scheduling

| journal=[[Mathematics of Operations Research]]

| volume=1

| issue=2

| pages=117–129

As| presented by Garey et aldoi=10. (1976),1287/moor.1.2.117}}</ref> most of extensions of the flow -shop -scheduling problems are NP-Hardhard and few of them can be solved optimally in O(nlogn),; for example, F2|prmu|C_max can be solved optimally by using [[Johnson's Rule]].<ref name=Johnson>{{cite journal

| last1=Johnson | first1=S. M.

| date=1954

| title=Optimal two-and three-stage production schedules with setup times included

| journal=Naval Research Logistics Quarterly

| volume=1

| issue=1

| pages=61–68

| doi=10.1002/nav.3800010110}}</ref>

*Taillard provides substantial benchmark problems for scheduling flow shops, open shops, and job shops.<ref name=Taillard>{{cite journal | doi=10.1016/0377-2217(93)90182-M | author=Taillard, E. | title=Benchmarks for basic scheduling problems | journal=European Journal of Operational Research |date=January 1993 | volume=64 | pages=278–285 | issue=2 | url=http://ideas.repec.org/a/eee/ejores/v64y1993i2p278-285.html }}</ref>

==Solution methods==

The proposed methods to solve flow -shop -scheduling problems can be classified as [[exact algorithm]] such as [[Branchbranch and Boundbound]] and [[Heuristicheuristic algorithm]] such as [[genetic algorithm]].

=== Minimizing makespan, C_max ===

F2|prmu|C_max and F3|prmu|C_max can be solved optimally by using [[Johnson's Rule]] (1954) but for general case there is no algorithm that guarantee the optimality of the solution.<br>

Here is minimization using Johnson's Rule:<br>

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{p_1i,p_2j} < min{p_1j,p_2i}''. Where as, p_1i is the processing time of job i on machine 1 and p_2i is the processing time of job i on machine 2. Similarly, p_1j and p_2j are processing times of job j on machine 1 and machine 2 respectively.<br>

The steps are summarized below for Johnson's algorithms:<br>

let,

p_1j=processing time of job j on machine 1<br>

p_2j=processing time of job j on machine 2

<br>

Johnson's Algorithm<br>

Step 1:Form set1 containing all the jobs with p_1j < p_2j <br>

Step 2:Form set2 containing all the jobs with p_1j > p_2j, the jobs with p_1j=p_2j may be put in either set.<br>

Step 3: Form the sequence as follows:<br>

(i) The job in set1 go first in the sequence and they go in increasing order of p_1j(SPT)<br>

(ii) The jobs in set2 follow in decreasing order of p_2j (LPT). Ties are broken arbitrarily.<br>

This type schedule is referred as SPT(1)-LPT(2) schedule.

F2|prmu|C_max and F3|prmu|C_max can be solved optimally by using [[Johnson's Rule]]<ref (1954)name=Johnson/> but for general case there is no algorithm that guarantee the optimality of the solution.<br>

=== Other objectives ===

The algorithm is optimal.

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:.

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

In an optimal schedule, job i precedes job j if ''min{p_1i,p_2j} < min{p_1j,p_2i}''. Where as, p_1i is the processing time of job i on machine 1 and p_2i is the processing time of job i on machine 2. Similarly, p_1j and p_2j are processing times of job j on machine 1 and machine 2 respectively.<br>

==Footnotes==

{{Reflist}}

For Johnson's algorithm:

:Let p_1j= be the processing time of job j on machine 1<br>

:and p_2j= the processing time of job j on machine 2

Johnson's Algorithm<br>algorithm:

Step# 1:Form set1 containing all the jobs with p_1j < p_2j <br>

Step# 2:Form set2 containing all the jobs with p_1j > p_2j, the jobs with p_1j = p_2j may be put in either set.<br>

Step 3:# Form the sequence as follows:<br>

#: (i) The job in set1 go first in the sequence and they go in increasing order of p_1j (SPT)<br>

#: (ii) The jobs in set2 follow in decreasing order of p_2j (LPT). Ties are broken arbitrarily.<br>

This type schedule is referred as SPT(1)-LPT–LPT(2) schedule.

TheA detailed discussion of the available solution methods are provided by [[Behnam Malakooti|Malakooti]] (2013).<ref name=Malakooti/>

==See also==

* [[Open-shop scheduling]]

* [[Job-shop scheduling]]

==References==

{{RefbeginReflist}}

* {{cite journal | doi=10.1016/0377-2217(93)90182-M | author=Taillard, E. | title=Benchmarks for basic scheduling problems | journal=European Journal of Operational Research |date=January 1993 | volume=64 | pages=278–285 | issue=2 | url=http://ideas.repec.org/a/eee/ejores/v64y1993i2p278-285.html }}

* Malakooti, B (2013). Operations and Production Systems with Multiple Objectives. John Wiley & Sons. {{ISBN|978-1-118-58537-5}}.

*Garey, M. R., Johnson, D. S., & Sethi, R. (1976). [https://pubsonline.informs.org/doi/abs/10.1287/moor.1.2.117 The complexity of flowshop and jobshop scheduling].{{closed access}} Mathematics of operations research, 1(2), 117-129.

*Johnson, S. M. (1954). [https://onlinelibrary.wiley.com/doi/abs/10.1002/nav.3800010110 Optimal two-and three-stage production schedules with setup times included].{{closed access}} Naval research logistics quarterly, 1(1), 61-68.

{{Refend}}

{{Scheduling problems}}

==External links==

* [http://posh-wolf.herokuapp.com/ Posh Wolf] - online flow shop solver with real-time visualization

[[Category:Optimal scheduling]]

[[Category:Workflow technology]]

[[Category:Engineering management]]