Abstract
We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time
| Original language | English |
|---|---|
| Pages (from-to) | 157-168 |
| Number of pages | 12 |
| Journal | Journal of Scheduling |
| Volume | 1 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 1998 |