| Article ID: | iaor19931353 |
| Country: | United States |
| Volume: | 17 |
| Issue: | 4 |
| Start Page Number: | 842 |
| End Page Number: | 865 |
| Publication Date: | Nov 1992 |
| Journal: | Mathematics of Operations Research |
| Authors: | Roundy Robin |
| Keywords: | networks: scheduling |
The paper considers the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, it assumes that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a predetermined sequence. Each operation can be performed on exactly one machine. Key structural properties of cyclic schedules are stuided. A search algorithm based on these properties is proposed, and preliminary conputational tests of the algorithm are reported.