Flow Shop Schedulling Flashcards by Fernando Espinoza | Brainscape

Q

Describe the Johnson’s Rule

A

Partition the jobs into two sets:
- Set I: p1j < p2j
- Set II: p1j > p2j
- Jobs where p1j = p2j holds go into either set
Schedule the jobs of set I in increasing order of p1j (SPT)
Schedule the jobs of set II in decreasing order of p2j (LPT)
* Schedule is optimal for F2 ||Cmax#

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Formulate the Mixed-integer programming model

A

Check notes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Describe the slope heuristic

A

Check notes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly

Q

Describe the Profile Fitting Heuristic

A

Check notes

How well did you know this?

1

Not at all

2

3

4

5

Perfectly