| Article ID: | iaor20012307 |
| Country: | United Kingdom |
| Volume: | 28 |
| Issue: | 2 |
| Start Page Number: | 127 |
| End Page Number: | 137 |
| Publication Date: | Feb 2001 |
| Journal: | Computers and Operations Research |
| Authors: | Azizoglu Meral, Webster Scott |
| Keywords: | programming: dynamic |
We address the problem of scheduling jobs with family setup times on identical parallel machines to minimize total weighted flowtime. We present two dynamic programming algorithms – a backward algorithm and a forward algorithm – and we identify characteristics of problems where each algorithm is best suited. We also derive two properties that improve the computational efficiency of the algorithms.