Paper Info
Title
Determining the optimal starting times in a cyclic schedule with a given route
Abstract
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.
Year
DOI
Venue
1993
10.1016/0305-0548(93)90102-O
Computers & OR
Keywords
DocType
Volume
cyclic schedule
Journal
20
Issue
ISSN
Citations 
9
Computers and Operations Research
16
PageRank 
References 
Authors
2.38
1
1
Name
Order
Citations
PageRank
Lei Lei1162.38