| Article ID: | iaor1994965 |
| Country: | United Kingdom |
| Volume: | 20 |
| Issue: | 8 |
| Start Page Number: | 807 |
| End Page Number: | 816 |
| Publication Date: | Oct 1993 |
| Journal: | Computers and Operations Research |
| Authors: | Lei Lei |
This paper introduces a binary search procedure that determines the optimal integer starting times for the operations in a cyclic transportation schedule with a given route and dependent time-windows. The objective is to minimize the cycle time.