Flow-shop scheduling: Difference between revisions

Revision as of 06:54, 2 October 2023

Latest revision as of 06:52, 19 April 2025

(One intermediate revision by one other user not shown)

Line 10:

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 ''m''-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 (γ)==

Line 21:

==Complexity of flow-shop scheduling==

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

As presented by Garey et al. (1976),<ref name=Garey>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.</ref> 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]].<ref name=Johnson>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.</ref>

| 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

| doi=10.1287/moor.1.2.117}}</ref> 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]].<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>