Single-machine capacitated lot-sizing and scheduling with delivery dates and quantities

References

• Almada-lobo, B., D. Klabjan, M. A. Carravilla, and J. F. Oliveira. 2007. “Single Machine Multi-Product Capacitated Lot Sizing with Sequence-Dependent Setups.” International Journal of Production Research 45: 4873–4894.
   Web of Science ®Google Scholar
• Boctor, F. F. 1987. “The G-Group Heuristic for Single-Machine Lot Scheduling.” International Journal of Production Research 25: 363–379.
   Web of Science ®Google Scholar
• Boctor, F. F., and P. Poulin. 2005. “Heuristics for N-Product, M-Stage Lot Sizing and Scheduling with Dynamic Demand.” International Journal of Production Research 43: 2809–2828.
   Web of Science ®Google Scholar
• Brahimi, N., S. Dauzere-Peres, N. M. Najid, and A. Nordli. 2006. “Single Item Lot Sizing Problems.” European Journal of Operational Research 168: 1–16.
   Web of Science ®Google Scholar
• Buschkühl, L., F. Sahling, S. Helber, and H. Tempelmeier. 2010. “Dynamic Capacitated Lot-Sizing Problems: A Classification and Review of Solution Approaches.” OR Spectrum 32: 231–261.
   Web of Science ®Google Scholar
• Copil, K., M. Wörbelauer, H. Meyr, and H. Tempelmeier. 2017. “Simultaneous Lot Sizing and Scheduling Problems: A Classification and Review of Models.” OR Spectrum 39: 1–64.
   Web of Science ®Google Scholar
• Delporte, C., and L. Thomas. 1978. “Lot Sizing and Sequencing for N Products on One Facility.” Management Science 23: 1070–1079.
   Web of Science ®Google Scholar
• Dobson, G. 1987. “The Economic Lot-Scheduling Problem: Achieving Feasibility Using Time-Varying Lot Sizes.” Operations Research 35: 764–771.
   Web of Science ®Google Scholar
• Elmaghraby, S. E. 1978. “The Economic Lot Scheduling Problem (ELSP): Review and Extensions.” Management Science 24: 587–598.
   Web of Science ®Google Scholar
• Fiorotto, D. J., J. Neyra, and S. de Ajaujo. 2020. “Impact Analysis of Setup Carryover and Crossover on Lot Sizing Problems.” International Journal of Production Research 58: 6350–6369.
   Web of Science ®Google Scholar
• Fleischmann, B., and H. Meyr. 1997. “The General Lot Sizing and Scheduling Problem.” OR Spektrum 19: 11–21.
   Google Scholar
• Gicquel, C., M. Minoux, and Y. Dallery. 2008. Capacitated Lot Sizing Models: A Literature Review. http://hal.archives-ouvertes.fr/docs/00/25/58/30/PDF/CER_Gicquel_2008_01.pdf.
   Google Scholar
• Gopalakrishnan, M. 2000. “A Modified Framework for Modeling Set-Up Carryover in the Capacitated Lot Sizing Problem.” International Journal of Production Research 38: 3421–3424.
   Web of Science ®Google Scholar
• Gopalakrishnan, M., K. Ding, J.-M. Bourjolly, and S. Mohan. 2001. “A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-Up Carryover.” Management Science 47: 851–863.
   Web of Science ®Google Scholar
• Gopalakrishnan, M., D. M. Miller, and C. P. Schmidt. 1995. “A Framework for Modeling Setup Carryover in the Capacitated Lot Sizing Problem.” International Journal of Production Research 33: 1973–1988.
   Web of Science ®Google Scholar
• Goren, H. G., S. Tunali, and R. Jans. 2012. “A Hybrid Approach for the Capacitated Lot Sizing Problem with Setup Carryover.” International Journal of Production Research 50: 1582–1597.
   Web of Science ®Google Scholar
• Gupta, D., and T. Magnusson. 2005. “The Capacitated Lot-Sizing and Scheduling Problem with Sequence-Dependent Setup Costs and Setup Times.” Computers & Operations Research 32: 727–747.
   Web of Science ®Google Scholar
• Hindi, K. S., K. Fleszar, and C. Charalambous. 2003. “An Effective Heuristic for the CLSP with Setup Times.” Journal of the Operational Research Society 54: 490–498.
   Web of Science ®Google Scholar
• Jans, R., and Z. Degraeve. 2007. “Meta Heuristics for Dynamic Lot Sizing: A Review and Comparison of Solution Approaches.” European Journal of Operational Research 177: 1855–1875.
   Web of Science ®Google Scholar
• Jans, R., and Z. Degraeve. 2008. “Modeling Industrial Lot Sizing Problems: A Review.” International Journal of Production Research 46: 1619–1643.
   Web of Science ®Google Scholar
• Karimi, B., S. M. T. F. Ghomi, and J. M. Wilson. 2003. “The Capacitated Lot Sizing Problem: A Review of Models and Algorithms.” Omega 31: 365–378.
   Web of Science ®Google Scholar
• Li, Y., Y. Tao, and F. Wang. 2012. “An Efficient Approach to Multi-Item Capacitated Dynamic Lot Sizing Problems.” International Journal of Production Research 50: 5348–5362.
   Web of Science ®Google Scholar
• Meyr, H. 2000. “Simultaneous Lot Sizing and Scheduling by Combining Local Search with Dual Re-Optimization.” European Journal of Operational Research 120: 311–326.
   Web of Science ®Google Scholar
• Miller, A. J., and L. A. Wolsey. 2003. “Tight MIP Formulations for Multi-Item Discrete Lot Sizing Problems.” Operations Research 51: 557–565.
   Web of Science ®Google Scholar
• Mohan, S., M. Gopalakrishnan, and A. Rajan. 2012. “A Note on Modeling the Capacitated Lot Sizing Problem with Set-Up Carry-Over and Set-Up Splitting.” International Journal of Production Research 50: 5538–5543.
   Web of Science ®Google Scholar
• Porkka, P., A. P. J. Vepsalainen, and M. Kuula. 2003. “Multi-Period Production Planning Carrying Over Set-Up Time.” International Journal of Production Research 41: 1133–1148.
   Web of Science ®Google Scholar
• Quadt, D., and H. Kuhn. 2008. “Capacitated Lot-Sizing with Extensions: A Review.” 4OR 6: 61–83.
   Web of Science ®Google Scholar
• Ramya, R., C. Rajendran, and H. Ziegler. 2016. “Capacitated Lot Sizing Problem with Production Carry-Over and Setup Splitting: Mathematical Models.” International Journal of Production Research 54: 2332–2344.
   Web of Science ®Google Scholar
• Raza, A. R., and A. Akgunduz. 2008. “A Comparative Study of Heuristic Algorithms on the Economic Lot Scheduling Problem.” Computers and Industrial Engineering 55: 94–109.
   Web of Science ®Google Scholar
• Singh, N., and D. Rajamani. 1991. “An Incremental Cost and Resource Smoothing Heuristic for the Capacitated Lot Sizing Problem.” Computers & Industrial Engineering 20: 469–474.
   Web of Science ®Google Scholar
• Sox, C. R., and Y. Gao. 1999. “The Capacitated Lot Sizing Problem with Setup Carry-Over.” IIE Transactions 31: 173–181.
   Web of Science ®Google Scholar
• Suerie, C., and H. Stadtler. 2003. “The Capacitated Lot-Sizing Problem with Linked Lot Sizes.” Management Science 49: 1039–1054.
   Web of Science ®Google Scholar
• Trigeiro, W. W. 1987. “A Dual-Cost Heuristic Fort he Capacitated lot Sizing Problem.” IIE Transactions 19: 67–72.
   Web of Science ®Google Scholar
• Trigeiro, W. W., L. J. Thomas, and J. O. McClain. 1989. “Capacitated Lot Sizing with Setup Times.” Management Science 35: 353–366.
   Web of Science ®Google Scholar
• Zhu, X., and W. E. Wilhelm. 2006. “Scheduling and Lot Sizing with Sequence-Dependent Setup: A Literature Review.” IIE Transactions 38: 987–1007.
   Web of Science ®Google Scholar