Production setup-sequencing and lot-sizing at an animal nutrition plant through atsp subtour elimination and patching
- 309 Downloads
This paper considers the usefulness of a production lot sizing and scheduling model at an animal nutrition plant with sequence-dependent setup times. The model covers multiple periods and is based on the asymmetric travelling salesman problem (atsp). It is applied initially to the case where the setup state is zeroed between periods, and then revised to model the carryover of the setup state from one period to the next. An iterative solution procedure based on subtour elimination is applied, and then enhanced by the inclusion of a subtour patching procedure. Case-based tests with actual plant data show that the subtour elimination is practicably fast where the setup state is zeroed between periods, but needs the patching procedure when the setup state is preserved, as is the situation at the plant. In this latter case, the subtour elimination and patching can be very fast, showing the method’s viability for operational lot sizing and sequencing in animal nutrition plants of the kind studied. Tests on perturbed plant data show that further algorithmic development is needed to tackle certain challenging variants found in other plants.
KeywordsLot sizing Production scheduling Sequence-dependent setup times Asymmetric travelling salesman problem Animal nutrition industry Case-study
Unable to display preview. Download preview PDF.
- Cirasella, J., Johnson, D. S., McGeoch, L. A., & 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. Google Scholar
- Ilog (2004). CPLEX 9.1 user’s manual, ILOG S.A. www.cplex.com.
- Jans, R., & Degraeve, Z. (2008). Modeling industrial lot sizing problems, a review. International Journal of Production Research, 46(6). Google Scholar
- Johnson, D. S., Gutin, G., McGeoch, L. A., Yeo, A., Zhang, W., & Zverovich, A. (2002). Experimental analysis of heuristics for the asymmetric travelling salesman problem—algorithms, instance generators and tests. In G. Gutin & A. P. Punnen (Eds.), The traveling salesman problem and its variations. Dordrecht: Kluwer. Google Scholar
- Junger, M., Reinelt, G., & Rinaldi, G. (1995). The traveling salesman problem. In M. O. Ball, T. L. Magnanti, C. L. Monma, & G. L. Nemhauser (Eds.), Handbooks in operations research and management science : Vol. 7. Network models (pp. 225–330). Amsterdam: North Holland. Chap. 4. CrossRefGoogle Scholar
- Karp, R. M., & Steele, J. M. (1985). Probabilistic analysis of heuristics. In E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, & D. B. Shmoys (Eds.), The traveling salesman problem—a guided tour of combinatorial optimization. Chichester: Wiley. Google Scholar
- Lawler, E. L., Lenstra, J. K., Rinnoy Kan, A. H. G., & Shmoys, D. B. (1985). The traveling salesman problem—a guided tour of combinatorial optimization. Chichester: Wiley. Google Scholar
- Luche, J. R. D., Morabito, R., & Pureza, V. (2009). Combining process selection and lot sizing models for the production scheduling of electrofused grains. Asia-Pacific Journal of Operations Research, 26(3). Google Scholar
- Nahmias, S. (1995). Production and operations analysis. Homewood: Irwin. Google Scholar
- Orman, A. J., & Williams, H. P. (2004). A survey of different integer programming formulations of the travelling salesman problem (Working paper LSEOR 04.67). London School of Economics, Deptartment of Operational Research, LSE, London. Google Scholar
- Pochet, Y., & Wolsey, L. A. (2006). Production planning by mixed integer programming. Berlin: Springer. Google Scholar
- Salomon, M., Solomon, M., Van Wassenhove, L. N., & 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. CrossRefGoogle Scholar
- Toso, E. A. V. (2008). Dimensionamento e seqüenciamento de lotes de produção na indústria de suplementos para nutrição animal. PhD thesis, Department of Production Engineering, Universidade Federal de São Carlos, Brazil. Complete text and data online at http://188.8.131.52/htdocs/tedeSimplificado/tde_busca/arquivo.php?codArquivo=1924.
- Wolsey, L. A. (1998). Integer programming. New York: Wiley. Google Scholar