Special cases of traveling salesman and repairman problems with time windows
暂无分享,去创建一个
[1] Wayne E. Smith. Various optimizers for single‐stage production , 1956 .
[2] M. Held,et al. A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.
[3] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[4] David S. Johnson,et al. Two-Processor Scheduling with Start-Times and Deadlines , 1977, SIAM J. Comput..
[5] John L. Bruno,et al. Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs , 1978, SIAM J. Comput..
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] J. Desrosiers,et al. Plus court chemin avec contraintes d'horaires , 1983 .
[8] Jacques Desrosiers,et al. A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows , 1984 .
[9] Martin W. P. Savelsbergh,et al. Local search in routing problems with time windows , 1984 .
[10] Editors , 1986, Brain Research Bulletin.
[11] George Papageorgiou,et al. The Complexity of the Travelling Repairman Problem , 1986, RAIRO Theor. Informatics Appl..
[12] J. Desrosiers,et al. Time Window Constrained Routing and Scheduling Problems: a Survey , 1987 .
[13] Mwp Martin Savelsbergh,et al. VEHICLE ROUTING WITH TIME WINDOWS: OPTIMIZATION AND APPROXIMATION. VEHICLE ROUTING: METHOD AND STUDIES. STUDIES IN MANAGEMENT SCIENCE AND SYSTEMS - VOLUME 16 , 1987 .
[14] Jacques Desrosiers,et al. Survey Paper - Time Window Constrained Routing and Scheduling Problems , 1988, Transp. Sci..
[15] Clyde L. Monma,et al. On the Complexity of Scheduling with Batch Setup Times , 1989, Oper. Res..
[16] Marius M. Solomon,et al. Routing and scheduling on a shoreline with release times , 1990 .