| Article ID: | iaor19951318 |
| Country: | United Kingdom |
| Volume: | 45 |
| Issue: | 8 |
| Start Page Number: | 942 |
| End Page Number: | 947 |
| Publication Date: | Aug 1994 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Kondakci S., Erkip N., Toker A. |
This paper considers the job shop scheduling problem under a discrete non-renewable resource constraint. It assumes that jobs have arbitrary processing times and resource requirements and there is a unit supply of the resource at each time period. It develops an approximation algorithm for this problem and empirically tests its effectiveness in finding the minimum makespan schedules.