On the Use of A Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs

References

• Ashour , S. , J. Vega , and R. G. Parker , “ A Heuristic Algorithm for Traveling Salesman Problems ,” J. Transportation Research , 6 ( 1972 ).
   Google Scholar
• Baker , K. R. and A. G. Merten , “ Scheduling with Parallel Processors and Linear Delay Costs ,” Naval Research Logistics Quarterly , 20 4 ( 1973 ).
   Google Scholar
• Clark , G. and J. Wright , “ Scheduling Vehicles from a Central Depot to a Number of Delivery Points ,” Operations Research , 12 , p. 568 ( 1964 ).
   Web of Science ®Google Scholar
• Conway , R. W. , W. L. Maxwell and L. W. Miller , Theory of Scheduling , Addison-Wesley , Reading , Mass . ( 1967 ).
   Google Scholar
• Dantzig , G. and J. Ramser , “ The Truck Dispatching Problem ,” Management Science , 6 , p. 80 ( 1959 ).
   Web of Science ®Google Scholar
• Deane , R. H. and E. R. White , “ Balancing Workloads and Minimizing Set-Up Costs in the Parallel Processing Shop ,” Operational Research Quarterly , 26 1 ( 1975 ).
   Google Scholar
• Eilon , S. , S. D. T. Watson-Gandy , and Nicos Christofides , Distribution Management , Griffin , London ( 1971 ).
   Google Scholar
• Gaskell , T. , “ Bases for Vehicle Fleet Scheduling ,” Operational Research Quarterly , 18 , p. 407 ( 1957 ).
   Google Scholar
• Gillett , B. E. and L. R. Miller , “ A Heuristic Algorithm for the Vehicle Dispatch Problem ,” Operations Research , 22 , p. 340 , ( 1974 ).
   Web of Science ®Google Scholar
• Hayes , R. , “ The Delivery Problem ,” Carnegie Institute of Technology, Graduate School of Industrial Administration, Pittsburgh, Report No. MSR 106 ( 1967 ).
   Google Scholar
• Holmes , R. A. , “ The Routing and Scheduling of a Class of Postal Vehicles ,” M.S. Thesis, Georgia Institute of Technology, ( 1975 ).
   Google Scholar
• Kedia , S. K. , “ A Job Shop Scheduling Problem with Parallel Machines ,” Unpublished Report, Department of Industrial Engineering, University of Michigan ( 1970 ).
   Google Scholar
• Lin , S. and B. Kerningham , “ An Effective Heuristic Algorithm for the Traveling Salesman Problem ,” Operations Research , 21 2 ( 1973 ).
   Google Scholar
• Perez , I. , “ On the Vehicle Scheduling Model and Associated Problems ,” M.S. Thesis, Georgia Institute of Technology, ( 1975 ).
   Google Scholar
• Rothkopf , M. H. , “ Scheduling Independent Tasks on Parallel Processors ,” Management Science , 12 5 ( 1966 ).
   Google Scholar
• Svestka , J. and V. E. Huckfelt , “ Computational Experience with an M-Salesman Traveling Salesman Algorithm ,” Management Science , 19 7 ( 1973 ).
   Web of Science ®Google Scholar
• Tillman , F. and H. Cochran , “ A Heuristic Approach for Solving the Delivery Problem ,” J. Industrial Engineering , 19 , p. 354 ( 1968 ).
   Google Scholar
• Turner , W. C. , P. M. Ghare and L. R. Fourds , “ Transportation Routing Problem-A Survey ,” AIIE Transactions 6 , p. 288 , ( 1975 ).
   Google Scholar