Vehicle scheduling with combinable delivery and pickup operations

Operations Research Letters

Volumn 37, Issue 6, 2009, Pages 399-404

  Lee, Chung Yee ^a   Qi, Xiangtong ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Computational complexity; Delivery and pickup; Dynamic programming; Scheduling

Indexed keywords

DELIVERY AND PICKUP; DELIVERY COMPANY; LOGISTICS OPERATIONS; RELEASE TIME; SCHEDULING MODELS; SEQUENCE-DEPENDENT SETUP TIME; VEHICLE SCHEDULING;

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; SYSTEMS ENGINEERING;

SCHEDULING;

EID: 70349986478     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2009.06.002     Document Type: Article

References (20)

1. Toth P., and Vigo D. The Vehicle Routing Problem (2002), SIAM
2. Hall R.W. Pickup and delivery systems for overnight carriers. Transportation Research Part A: Policy and Practice 30 (1996) 173-187
3. Barnes-Schuster D., and Bassok Y. Direct shipping and the dynamic single-depot/multi-retailer inventory system. European Journal of Operational Research 101 (1997) 509-518
4. Gallego G., and Simchi-Levi D. On the effectiveness of direct shipping strategy for the one-warehouse multi-retailer R-systems. Management Science 36 (1990) 240-243
5. Bertazzi L. Analysis of direct shipping policies in an inventory-routing problem with discrete shipping times. Management Science 54 (2008) 748-762
6. Dror M., and Ball M. Inventory/routing: Reduction from an annual to a short-period problem. Naval Research Logistics 34 (1987) 891-905
7. Kleywegt A.J., Nori V.S., and Savelsbergh M.W.P. The stochastic inventory routing problem with direct deliveries. Transportation Science 36 (2002) 94-118
8. Li J.-A., Wu Y., Lai K.K., and Liu K. Replenishment routing problems between a single supplier and multiple retailers with direct delivery. European Journal of Operational Research 190 (2008) 412-420
9. Gu J., Goetschalckx M., and McGinnis L.F. Research on warehouse operation: A comprehensive review. European Journal of Operational Research 177 (2007) 1-21
10. Lee M.-K., and Kim S.-Y. Scheduling of storage/retrieval orders under a just-in-time environment. International Journal of Production Research 33 (1995) 3331-3348
11. Lee Y.H., Bhaskaran K., and Pinedo M. A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions 29 (1997) 45-52
12. Bianco L., Dell'Olmo P., and Giordani S. Flow shop no-wait scheduling with sequence dependent setup times and release dates. INFOR 37 (1999) 3-19
13. Yuan J.J., Liu A.H., Ng C.T., and Cheng T.C.E. Single machine batch scheduling problem with family setup times and release dates to minimize makespan. Journal of scheduling 9 (2006) 499-513
14. Pinedo M. Scheduling: Theory, Algorithms, and Systems (2001), Prentice Hall
15. Hong S.-C., and Park Y.-B. A heuristic for bi-objective vehicle routing with time window constraints. International Journal of Production Economics 62 (1999) 249-258
16. Garcia A., Jodra P., and Tejel J. A note on the traveling repairman problem. Networks 40 (2002) 27-31
17. Tsitsiklis J.N. Special cases of traveling salesman and repairman problems with time windows. Networks 22 (1992) 263-282
18. Solomon M., and Desrosiers J. Time window constrained routing and scheduling problems. Transportation Science 22 (1988) 1-13
19. Garey M.R., Tarjan R.E., and Wilforg G.T. One processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13 (1988) 330-348
20. Garey M.R., and Johnson D.S. Computer and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman and Company, New York