| Article ID: | iaor20002086 |
| Country: | United States |
| Volume: | 45 |
| Issue: | 5 |
| Start Page Number: | 768 |
| End Page Number: | 769 |
| Publication Date: | May 1999 |
| Journal: | Management Science |
| Authors: | Webster Scott |
| Keywords: | production, computational analysis |
Computational complexity results provide guideposts toward fruitful directions in algorithmic research and therefore play an important role in research on algorithm design. This note discusses complexity analysis in the context of lotsizing and scheduling problems.