| Article ID: | iaor1992155 |
| Country: | United Kingdom |
| Volume: | 18 |
| Start Page Number: | 453 |
| End Page Number: | 456 |
| Publication Date: | Nov 1991 |
| Journal: | Computers and Operations Research |
| Authors: | Lee In-Soo |
| Keywords: | programming: dynamic |
In this note, is calculated tight lower and upper bounds on the number of dominant schedules for a deterministic production scheduling model with piecewise concave costs and unlimited capacities. This will correct a flaw found in a classical paper of Zangwill.