Erratum: Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching (Journal of Scheduling (2010) 13 (111-121) DOI: 10.1007/s10951-009-0135-7);Production setup-sequencing and lot-sizing at an animal nutrition plant through ATSP subtour elimination and patching

Journal of Scheduling

Volumn 13, Issue 2, 2010, Pages 111-121

  Clark, Alistair R ^a   Morabito, Reinaldo ^b   Toso, Eli A V ^b  

^a UNIVERSITY OF THE WEST OF ENGLAND   (United Kingdom)

^b FEDERAL UNIVERSITY OF SÃO CARLOS   (Brazil)

Author keywords

Animal nutrition industry; Asymmetric travelling salesman problem; Case study; Lot sizing; Production scheduling; Sequence dependent setup times

Indexed keywords

ANIMALS; ITERATIVE METHODS; NUTRITION; OPTIMIZATION; PRODUCTION CONTROL; SCHEDULING;

ANIMAL NUTRITIONS; ASYMMETRIC TRAVELLING SALESMAN PROBLEMS; LOT SIZING; PRODUCTION SCHEDULING; SEQUENCE-DEPENDENT SETUP TIME;

TRAVELING SALESMAN PROBLEM;

EID: 77952430972     PISSN: 10946136     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10951-010-0175-z     Document Type: Erratum

References (40)

1. Araújo, S. A., Arenales, M. N., and Clark, A. R. (2007). Joint rolling horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. Journal of Heuristics, 13(4), 337-358.
2. Araújo, S. A., Arenales, M. N., and Clark, A. R. (2008). Lot-sizing and furnace scheduling in small foundries. Computers and Operations Research, 35,916-932.
3. Arosio, M., and Sianesi, A. (1993). A heuristic algorithm for master production scheduling generation with finite capacity and sequence dependent setups. International Journal ofProduction Research, 31, 531-553.
4. Buriol, L., Franca, P. M., and Moscato, P. (2004). A new memetic algorithm for the asymmetric traveling salesman problem. Journal of Heuristics, 10(5), 483-506.
5. Carpaneto, G., Dell'Amico, M., and Toth, P. (1995). Exact solution of large scale asymmetric travelling salesman problems. ACM Transactions on Mathematical Sofware, 21(4), 394-409.
6. Cirasella, J., Johnson, D. S., McGeoch, L. A., and Zhang, W. (2001). The asymmetric traveling salesman problem: Algorithms, instance generators, and tests. In Springer lecture notes in computer science (Vol. 2153, pp. 32-59). Berlin: Springer.
7. Clark, A. R. (2003). Optimization approximations for capacity constrained material requirements planning. International Journal of Production Economics, 84(2), 115-131.
8. Clark, A. R., and Clark, S. J. (2000). Rolling-horizon lot-sizing when setup times are sequence-dependent. International Journal of Production Research, 38(10), 2287-2308.
9. Dillenberger, C., Escudero, L. F., Wollensak, A., & Zhang, W. (1994). On practical resource allocation for production planning and scheduling with different setup products. European Journal of Operational Research, 5(2), 275-286.
10. Drexl, A., and Kimms, A. (1997). Lot sizing and scheduling-survey and extensions. European Journal of Operational Research, 99, 221-235.
11. Ferreira, D., Morabito, R., and Rangel, S. (2009). Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research, 196, 697-706.
12. Fleischmann, B., and Meyr, H. (1997). The general lotsizing and scheduling problem. OR Spektrum, 19(1), 11-21.
13. Fourer, R., Gay, D. M., and Kernighan, B. W. (2003). AMPL-a modelling language for mathematical programming (2ndEd.).N.Scituate: Duxbury Press. http://www.ampl.com/.
14. Frieze, A. M., and Dyer, M. E. (1990). On a patching algorithm for the random asymmetric travelling salesman problem. Mathematical Programming, 46, 361-378.
15. Frieze, A. M., Karp, R. M., and Reed, B. (1995). When is the assignment bound tight for the asymmetric traveling-salesman problem? SIAM Journal on Computing, 24(3), 484-493.
16. Glover, F., Gutin, G., Yeo, A., and Zverovich, A. (2001). Construction heuristics for the asymmetric tsp. European Journal of Operational Research, 129, 555-568.
17. Gupta, D., and Magnusson, T. (2005). The capacitated lot-sizing and scheduling problem with sequence-dependent setup costs and setup times. Computers and Operations Research, 32(4), 727-747.
18. Ilog (2004). CPLEX 9.1 user's manual, ILOG S.A. www.cplex.com.
19. Jans, R., and Degraeve, Z. (2008). Modeling industrial lot sizing problems, a review. International Journal ofProduction Research, 46(6).
20. Johnson, D. S., Gutin, G., McGeoch, L. A., Yeo, A., Zhang, W., and Zverovich, A. (2002). Experimental analysis of heuristics for the asymmetric travelling salesman problem-algorithms, instance generators and tests. In G. Gutin and A. P. Punnen (Eds.), The traveling salesman problem and its variations. Dordrecht: Kluwer.
21. Junger, M., Reinelt, G., and Rinaldi, G. (1995). The traveling salesman problem. In M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser (Eds.), Handbooks in operations research and management science: Vol. 7. Nework models (pp. 225-330). Amsterdam: North Holland. Chap. 4.
22. Kang, S., Malik, K., and Thomas, L. J. (1999). Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Science, 45(2), 273-289.
23. Karimi, B., Fatemi Ghomia, S. M. T., and Wilson, J. M. (2003). The capacitated lot sizing problem, a review of models and algorithms. Omega, 31, 365-378.
24. Karp, R. M. (1979). A patching algorithm for the nonsymmetric traveling-salesman problem. SIAM Journal on Computing, 8(4), 561-573.
25. Karp, R. M., and Steele, J. M. (1985). Probabilistic analysis of heuristics. InE.L.Lawler,J.K.Lenstra,A.H.G.RinnoyKan,and D.B. Shmoys (Eds.), The traveling salesman problem-a guided tour ofcombinatorial optimization. Chichester: Wiley.
26. Laporte, G. (1994). The travelling salesman problem, an overview of exact and approximate algorithms. European Journal ofOperational Research, 59, 231-247.
27. Lawler, E. L., Lenstra, J. K., Rinnoy Kan, A. H. G., & Shmoys, D. B. (1985). The traveling salesman problem-a guided tour ofcom- binatorial optimization. Chichester: Wiley. Luche, J. R. D., Morabito, R., & Pureza, V. (2009).
28. Combining process selection and lot sizing models for the production scheduling of electrofused grains. Asia-Pacific Journal of Operations Research, 26(3).
29. Meyr, H. (2000). Simultaneous lot-sizing and scheduling by combining local search with dual optimization. European Journal ofOperational Research, 120, 311-326.
30. Meyr, H. (2000). Simultaneous lot-sizing and scheduling by combining local search with dual optimization. European Journal ofOperational Research, 120, 311-326.
31. Orman, A. J., and Williams, H. P. (2004). A survey ofdifferent integer programming formulations ofthe travelling salesman problem (Working paper LSEOR 04.67). London School of Economics, Deptartment of Operational Research, LSE, London.
32. Pochet, Y., and Wolsey, L. A. (2006). Production planning by mixed integer programming. Berlin: Springer.
33. Salomon, M., Solomon, M., Van Wassenhove, L. N., and Dumas, Y. (1997). Solving the discrete lot sizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows. European Journal of Operational Research, 100, 494-513.
34. Smith-Daniels, V. L., and Smith-Daniels, D. E. (1986). A mixed integer programming model for lot sizing and sequencing packaging lines in the process industries. IIE Transactions, 18(3), 278-285.
35. Toledo, C. F. M., Franca, P. M., Morabito, R., and Kimms, A. (2009). A multi-population genetic algorithm to solve the synchronized and integrated two-level lot-sizing and scheduling problem. International Journal of Production Research, 47(11), 3097-3119.
36. Toso, E. A. V. (2008). Dimensionamento e sequenciamento de lotes de produção na industria de suplementos para nutrição animal. PhD thesis, Department of Production Engineering, Universidade Federal de Sao Carlos, Brazil. Complete text and data online at http://200.136.241.56/ htdocs/tedeSimplificado/tde-busca/arquivo.php?codArquivo=1924.
37. Toso, E. A. V., Morabito, R., and Clark, A. R. (2009). Lot-sizing and sequencing optimisation at an animal-feed plant. Computers and Industrial Engineering, 57(3), 813-821.
38. Wolsey, L. A. (1995). Progress with single-item lot-sizing. European Journal ofOperational Research, 86, 395-401.
39. Wolsey, L. A. (1998). Integerprogramming.New York:Wiley.
40. Zhang, W. (1997). A note on the complexity of the asymmetric travelling salesman problem. Operations Research Letters, 20, 31-38.