Nghiên cứu trường hợp: Cải thiện khả năng cạnh tranh trong ngành công nghiệp: Phương pháp TSP

Baker, E.K. (1983), “An exact algorithm for the time‐constrained travelling salesman problem”, Operations Research, Vol. 31 No. 5. Baker, K.R. and Scudder, G. (1990), “Sequencing with earliness and tardiness penalties: a review”, Operations Research, Vol. 38 No. 1. Canen, A.G. and Lawrie, N.L. (1995), “Looking at customer service in a drinks company”, Logistics Information Management, Vol. 8 No. 1. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. and Schmoys, D.B. (Eds) (1985), The Travelling Salesman Problem, John Wiley & Sons, Chichester. Pizzolato, N.D., Almeida, E.M., Guerrero, S.G.V. and Lima, R.V. (1996), Production Management Practice in Developing Countries: A Case Study, IFORS 96 Conference, Vancouver, Canada. Ventura, J.A. and Weng, M. (1996), “Single machine scheduling with common delivery windows”, Journal of the Operational Research Society, Vol. 47 No. 3. Williams, H.P. (1985), Model Building in Mathematical Programming, John Wiley & Sons, Chichester.