The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan

References

• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms, and Applications (1993) (Prentice-Hall, Upper Saddle River, NJ) Google Scholar
• Arbib C., Pacciarelli D., Smriglio S. A three-dimensional matching model for perishable production scheduling. Discrete Appl. Math. (1999) 92:1–15Crossref, Google Scholar
• Beasley J. E. Route first–cluster second methods for vehicle routing. Omega (1983) 11:403–408Crossref, Google Scholar
• Bourjolly J.-M., Rebetez V. An analysis of lower bound procedures for the bin packing problem. Comput. Oper. Res. (2005) 32:395–406Crossref, Google Scholar
• Cervone G., Michalski R. S. Design and experiments with the LEM2 implementation of the learnable evolution model. (2000) . Reports of the machine learning and inference laboratory, MLI 00-2, George Mason University, Fairfax, VAGoogle Scholar
• Chen Z. L., Pundoor G. Order assignment and scheduling in a supply chain. Oper. Res. (2004) 54:555–574Link, Google Scholar
• Chen Z. L., Vairaktarakis G. Integrated scheduling of production and distribution operations. Management Sci. (2005) 51:614–628Link, Google Scholar
• Christofides N., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Vehicle routing. The Traveling Salesman Problem (1985) (John Wiley & Sons, New York) 431–448Google Scholar
• Cordeau J.-F., Laporte G., Rego C., Alidaee B. Tabu search heuristics for the vehicle routing problem. Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search (2004) (Springer, New York) 145–163Google Scholar
• Cordeau J.-F., Laporte G., Mercier A. A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. (2004) 52:928–936Crossref, Google Scholar
• Cordeau J.-F., Desaulniers G., Desrosiers J., Solomon M. M., Soumis F., Toth P., Vigo D. VRP with time windows. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002) (SIAM, Philadelphia) 157–193Crossref, Google Scholar
• Cordeau J.-F., Gendreau M., Hertz A., Laporte G., Sormany J.-S., Langevin A., Riopel D. New heuristics for the vehicle routing problem. Logistics Systems Design and Optimization (2005) (Springer, New York) 279–297Crossref, Google Scholar
• De Jong K. A. An analysis of the behavior of a class of genetic adaptive systems. Dissertation Abstr. Internat. (1975) 36:5140BDoctoral dissertation, University of Michigan. (University Microfilms 76-9381)Google Scholar
• Diaby M., Bahl H. C., Karwan M. H., Zionts S. A Lagrangean relaxation approach for very-large-scale capacitated lot-sizing. Management Sci. (1992) 38:1329–1340Link, Google Scholar
• Gendreau M., Laporte G., Potvin J.-Y., Toth P., Vigo D. Metaheuristics for the VRP. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications (2002) (SIAM, Philadelphia) 129–154Google Scholar
• Gilmore P., Gomory R. Sequencing a one-state variable machine: A solvable case of the traveling salesman problem. Oper. Res. (1964) 12:675–679Link, Google Scholar
• Glover F., Laguna M., Martí R., Ghosh A., Tsutsui S. Scatter search. Advances in Evolutionary Computation: Theory and Applications (2003) (Springer-Verlag, New York) 519–537Crossref, Google Scholar
• Goldberg D. E.Genetic Algorithm in Search, Optimization and Machine Learning (1989) (Addison-Wesley, Reading, MA) Google Scholar
• Hadjiconstantinou E., Christofides N., Mingozzi A. A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Ann. Oper. Res. (1995) 61:21–43Crossref, Google Scholar
• Hochbaum D., Hong S. P. On the complexity of production and transportation problems. SIAM J. Optim. (1996) 6:250–264Crossref, Google Scholar
• Labbé M., Laporte G., Mercure H. Capacitated vehicle routing on trees. Oper. Res. (1991) 39:616–622Link, Google Scholar
• Laporte G., Semet F., Toth P., Vigo D. Classical heuristics for the capacitated VRP. The Vehicle Routing Problem (2002) (Wiley, Chichester, UK) 337–360Crossref, Google Scholar
• Lotfi V., Chen W. H. An optimal algorithm for the multi-item capacitated production planning problem. Eur. J. Oper. Res. (1991) 52:179–193Crossref, Google Scholar
• Nahmias S. Perishable inventory theory: A review. Oper. Res. (1982) 30:680–708Link, Google Scholar
• Palekar U. S., Karwan M. H., Zionts S. A branch-and-bound method for the fixed-charge transportation problem. Management Sci. (1990) 36:1092–1105Link, Google Scholar
• Papadimitrious C. H. The Euclidean traveling salesman problem is NP-complete. Theoret. Comput. Sci. (1977) 4:237–244Crossref, Google Scholar
• Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. (2004) 31:1985–2002Crossref, Google Scholar
• Prins C. Private communication. (2005) . Institute Charles Delaunay, University of Technology of Troyes, Troyes Cedex, FranceGoogle Scholar
• Sarmiento A., Nagi M. R. A review of integrated analysis of production-distribution systems. IIE Trans. (1999) 31:1061–1074Crossref, Google Scholar
• Tuy H., Ghannadan S., Migdalas A., Varbrand P. A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables. Math. Programming (1996) 72:229–258Crossref, Google Scholar