{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T10:42:23Z","timestamp":1776768143413,"version":"3.51.2"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,12,23]],"date-time":"2009-12-23T00:00:00Z","timestamp":1261526400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10951-009-0156-2","type":"journal-article","created":{"date-parts":[[2009,12,22]],"date-time":"2009-12-22T21:48:27Z","timestamp":1261518507000},"page":"245-259","source":"Crossref","is-referenced-by-count":37,"title":["Capacitated lot sizing and sequence dependent setup scheduling: an iterative approach for integration"],"prefix":"10.1007","volume":"13","author":[{"given":"Geraldo R.","family":"Mateus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mart\u00edn G.","family":"Ravetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maur\u00edcio C.","family":"de Souza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ta\u00eds M.","family":"Valeriano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,23]]},"reference":[{"key":"156_CR1","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J. Adams","year":"1988","unstructured":"Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34, 391\u2013401.","journal-title":"Management Science"},{"key":"156_CR2","doi-asserted-by":"crossref","first-page":"4873","DOI":"10.1080\/00207540601094465","volume":"45","author":"B. Almada-Lobo","year":"2007","unstructured":"Almada-Lobo, B., Klabjan, D., Carravilla, M. A., & Oliveira, J. F. (2007). Single machine multi-product capacitated lot sizing with sequence-dependent setups. International Journal of Production Research, 45, 4873\u20134894.","journal-title":"International Journal of Production Research"},{"key":"156_CR3","first-page":"361","volume-title":"Local search in combinatorial optimization","author":"E. J. Anderson","year":"1997","unstructured":"Anderson, E. J., Glass, C. A., & Potts, C. N. (1997). Machine scheduling. In E. Aarts & J. K. Lenstra (Eds.), Local search in combinatorial optimization (pp.\u00a0361\u2013414). New York: Wiley."},{"key":"156_CR4","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1287\/mnsc.47.7.993.9800","volume":"47","author":"G. Belvaux","year":"2001","unstructured":"Belvaux, G., & Wolsey, L. A. (2001). Modelling practical lot-sizing problems as mixed-integer programs. Management Science, 47, 993\u20131007.","journal-title":"Management Science"},{"key":"156_CR5","first-page":"1129","volume":"29","author":"P. J. Billigton","year":"1983","unstructured":"Billigton, P. J., McClain, J. O., & Thomas, L. J. (1983). Mathematical approaches to capacity-constrained MRP systems: review, formulation and problem reduction. Management Science, 29, 1129\u20131141.","journal-title":"Management Science"},{"key":"156_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling computer and manufacturing processes","author":"J. B\u0142a\u017cewicz","year":"1996","unstructured":"B\u0142a\u017cewicz, J., Ecker, K. H., Pesch, E., Schmidt, G., & W\u0119glarz, J. (1996). Scheduling computer and manufacturing processes. Berlin: Springer."},{"key":"156_CR7","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1080\/00207540050028106","volume":"38","author":"A. R. Clark","year":"2000","unstructured":"Clark, A. R., & Clark, S. J. (2000). Rolling-horizon lot-sizing when set-up times are sequence-dependent. International Journal of Production Research, 38, 2287\u20132307.","journal-title":"International Journal of Production Research"},{"key":"156_CR8","volume-title":"Theory of scheduling","author":"R. W. Conway","year":"1967","unstructured":"Conway, R. W., Maxwell, W. L., & Miller, L. W. (1967). Theory of scheduling. Reading: Addison\u2013Wesley."},{"key":"156_CR9","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1080\/00207549308956766","volume":"31","author":"S. Dauz\u00e8re-P\u00e9res","year":"1993","unstructured":"Dauz\u00e8re-P\u00e9res, S., & Lasserre, J.-B. (1993). A modified shifting bottleneck procedure for job-shop scheduling. International Journal of Production Research, 31, 923\u2013932.","journal-title":"International Journal of Production Research"},{"key":"156_CR10","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0377-2217(94)90085-X","volume":"75","author":"S. Dauz\u00e8re-P\u00e9res","year":"1994","unstructured":"Dauz\u00e8re-P\u00e9res, S., & Lasserre, J.-B. (1994). Integration of lotsizing and scheduling decisions in a job-shop. European Journal of Operational Research, 75, 413\u2013426.","journal-title":"European Journal of Operational Research"},{"key":"156_CR11","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10732-007-9011-9","volume":"13","author":"S. A. Araujo de","year":"2007","unstructured":"de Araujo, S. A., Arenales, M. N., & Clark, A. R. (2007). Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups. Journal of Heuristics, 13, 337\u2013358.","journal-title":"Journal of Heuristics"},{"key":"156_CR12","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.cor.2006.05.010","volume":"35","author":"S. A. Araujo de","year":"2008","unstructured":"de Araujo, S. A., Arenales, M. N., & Clark, A. R. (2008). Lot sizing and furnace scheduling in small foundries. Computers & Operations Research, 35, 916\u2013932.","journal-title":"Computers & Operations Research"},{"key":"156_CR13","unstructured":"de Carvalho, C. R. V. (1998). Une proposition d\u2019integration de la planification et l\u2019ordonancement de production: application de la m\u00e9tode de benders. PhD Thesis, Laboratoire d\u2019Informatique de Mod\u00e9lisation et d\u2019Optimisation des Syst\u00e8mes, Universit\u00e9 Blaise Pascal, Clermont-Ferrand, France (in French)."},{"key":"156_CR14","doi-asserted-by":"crossref","first-page":"1329","DOI":"10.1287\/mnsc.38.9.1329","volume":"38","author":"M. Diaby","year":"1992","unstructured":"Diaby, M., Bahl, H. C., Karwan, M. H., & Zionts, S. (1992). A Lagrangean relaxation approach to very large scale capacitated lot-sizing. Management Science, 38, 1329\u20131340.","journal-title":"Management Science"},{"key":"156_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0377-2217(97)00030-1","volume":"99","author":"A. Drexl","year":"1997","unstructured":"Drexl, A., & Kimms, A. (1997). Lot sizing and scheduling\u2014Survey and extensions. European Journal of Operational Research, 99, 221\u2013235.","journal-title":"European Journal of Operational Research"},{"key":"156_CR16","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y. Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., Gelinas, E., & Solomon, M. M. (1995). An optimal algorithm for the traveling salesman problem with time windows. Operations Research, 43, 367\u2013371.","journal-title":"Operations Research"},{"key":"156_CR17","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. A. Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"156_CR18","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1016\/j.ejor.2008.03.035","volume":"196","author":"D. Ferreira","year":"2009","unstructured":"Ferreira, D., Morabito, R., & Rangel, S. (2009). Solution approaches for the soft drink integrated production lot sizing and scheduling problem. European Journal of Operational Research, 196, 697\u2013706.","journal-title":"European Journal of Operational Research"},{"key":"156_CR19","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/0377-2217(94)90083-3","volume":"75","author":"B. Fleischmann","year":"1994","unstructured":"Fleischmann, B. (1994). The discrete lot-sizing and scheduling problem. European Journal of Operational Research, 75, 395\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"156_CR20","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01539800","volume":"19","author":"B. Fleischmann","year":"1997","unstructured":"Fleischmann, B., & Meyr, H. (1997). The general lotsizing and scheduling problem. OR Spektrum, 19, 11\u201321.","journal-title":"OR Spektrum"},{"key":"156_CR21","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01539882","volume":"18","author":"K. Haase","year":"1996","unstructured":"Haase, K. (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spektrum, 18, 51\u201359.","journal-title":"OR Spektrum"},{"key":"156_CR22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-5273(99)00119-X","volume":"66","author":"K. Haase","year":"2000","unstructured":"Haase, K., & Kimms, A. (2000). Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66, 159\u2013169.","journal-title":"International Journal of Production Economics"},{"key":"156_CR23","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.ejor.2005.12.008","volume":"177","author":"R. Jans","year":"2007","unstructured":"Jans, R., & Degraeve, Z. (2007). Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. European Journal of Operational Research, 177, 1855\u20131875.","journal-title":"European Journal of Operational Research"},{"key":"156_CR24","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/mnsc.45.2.273","volume":"45","author":"S. Kang","year":"1999","unstructured":"Kang, S., Malik, K., & Thomas, L. J. (1999). Lotsizing and scheduling on parallel machines with sequence-dependent setup costs. Management Science, 45, 273\u2013289.","journal-title":"Management Science"},{"key":"156_CR25","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B. Karimi","year":"2003","unstructured":"Karimi, B., Fatemi Ghomi, S. M. T., & Wilson, J. M. (2003). The capacitated lot sizing problem: a review of models and algorithms. Omega, 31, 365\u2013378.","journal-title":"Omega"},{"key":"156_CR26","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1287\/opre.33.2.326","volume":"33","author":"U. Karmarkar","year":"1985","unstructured":"Karmarkar, U., & Schrage, L. (1985). The deterministic dynamic product cycling problem. Operations Research, 33, 326\u2013345.","journal-title":"Operations Research"},{"key":"156_CR27","volume-title":"Operations management: strategy and analysis","author":"L. J. Krajewski","year":"1993","unstructured":"Krajewski, L. J., & Ritzman, L. P. (1993). Operations management: strategy and analysis (3rd ed.). Reading: Addison\u2013Wesley.","edition":"3"},{"key":"156_CR28","series-title":"Handbooks in operations research and management science: Vol.\u00a04","first-page":"455","volume-title":"Logistics of production and inventory","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnoy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In S. C. Graves, A. H. G. Rinnoy Kan, & P.H. Zipkin (Eds.), Handbooks in operations research and management science: Vol.\u00a04. Logistics of production and inventory (pp.\u00a0455\u2013522). Amsterdam: North-Holland."},{"key":"156_CR29","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1287\/mnsc.38.8.1201","volume":"38","author":"J.-B. Lasserre","year":"1992","unstructured":"Lasserre, J.-B. (1992). An integrated model for job-shop planning and scheduling. Management Science, 38, 1201\u20131211.","journal-title":"Management Science"},{"key":"156_CR30","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"A. S. Manne","year":"1960","unstructured":"Manne, A. S. (1960). On the job-shop scheduling problem. Operations Research, 8, 219\u2013223.","journal-title":"Operations Research"},{"key":"156_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M. Matsumoto","year":"1998","unstructured":"Matsumoto, M., & Nishimura, T. (1998). Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation, 8, 3\u201330.","journal-title":"ACM Transactions on Modeling and Computer Simulation"},{"key":"156_CR32","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0377-2217(01)00373-3","volume":"139","author":"H. Meyr","year":"2002","unstructured":"Meyr, H. (2002). Simultaneous lotsizing and scheduling on parallel machines. European Journal of Operational Research, 139, 277\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"156_CR33","unstructured":"Miller, A. J., Nemhauser, G. L., & Savelsbergh, M. W. P. (2000). Solving the multi-item capacitated lot-sizing problem with setup times by branch-and-cut. CORE Discussion Paper 2000\/39, CORE, Universit\u00e9 Catholique de Louvain, Belgium."},{"key":"156_CR34","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-002-0325-y","volume":"94","author":"A. J. Miller","year":"2003","unstructured":"Miller, A. J., Nemhauser, G. L., & Savelsbergh, M. W. P. (2003). On the polyhedral structure of a multi-item production planning model with setup times. Mathematical Programming, 94, 375\u2013405.","journal-title":"Mathematical Programming"},{"key":"156_CR35","volume-title":"Scheduling: theory, algorithms and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling: theory, algorithms and systems. New York: Prentice Hall."},{"key":"156_CR36","volume-title":"Planning and scheduling in manufacturing an services","author":"M. Pinedo","year":"2005","unstructured":"Pinedo, M. (2005). Planning and scheduling in manufacturing an services. Berlin: Springer."},{"key":"156_CR37","series-title":"Lecture notes in computer science: Vol.\u00a02241","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-45586-8_3","volume-title":"Computational combinatorial optimization","author":"Y. Pochet","year":"2001","unstructured":"Pochet, Y. (2001). Mathematical programming models and formulations for deterministic production planning problems. In M. J\u00fcnger & D. Naddef (Eds.), Lecture notes in computer science: Vol.\u00a02241. Computational combinatorial optimization (pp.\u00a057\u2013111). Berlin: Springer."},{"key":"156_CR38","volume-title":"Production planning by mixed integer programming","author":"Y. Pochet","year":"2006","unstructured":"Pochet, Y., & Wolsey, L. A. (2006). Production planning by mixed integer programming. Berlin: Springer."},{"key":"156_CR39","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1504\/IJOR.2007.014169","volume":"2","author":"M. G. Ravetti","year":"2007","unstructured":"Ravetti, M. G., Rocha, P. L., Mateus, G. R., & Pardalos, P. (2007). A scheduling problem with unrelated parallel machines and sequence dependent setups. International Journal of Operational Research, 2, 380\u2013399.","journal-title":"International Journal of Operational Research"},{"key":"156_CR40","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"P. L. Rocha","year":"2008","unstructured":"Rocha, P. L., Ravetti, M. G., Mateus, G. R., & Pardalos, P. M. (2008). Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Computers & Operations Research, 35, 1250\u20131264.","journal-title":"Computers & Operations Research"},{"key":"156_CR41","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1016\/S0377-2217(96)00020-3","volume":"100","author":"M. Salomon","year":"1997","unstructured":"Salomon, M., Solomon, M. M., Van Wassenhove, L. N., Dumas, Y., & Dauz\u00e8re-P\u00e9r\u00e8s, S. (1997). Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the traveling salesman problem with time windows. European Journal of Operational Research, 100, 494\u2013513.","journal-title":"European Journal of Operational Research"},{"key":"156_CR42","doi-asserted-by":"crossref","first-page":"3097","DOI":"10.1080\/00207540701675833","volume":"47","author":"C. F. M. Toledo","year":"2009","unstructured":"Toledo, C. F. M., Fran\u00e7a, P. M., Morabito, R., & Kimms, A. (2009). Multi-population genetic algorithm to solve the synchronized and integrated two-level lot sizing and scheduling problem. International Journal of Production Research, 47, 3097\u20133119.","journal-title":"International Journal of Production Research"},{"key":"156_CR43","doi-asserted-by":"crossref","unstructured":"Toso, E. A. V., Morabito, R., & Clark, A. R. (2009). Lot sizing and sequencing optimisation at an animal-feed plant. Computers & Industrial Engineering. doi: 10.1016\/j.cie.2009.02.011 .","DOI":"10.1016\/j.cie.2009.02.011"},{"key":"156_CR44","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"W. W. Trigeiro","year":"1989","unstructured":"Trigeiro, W. W., Thomas, L. J., & McClain, J. O. (1989). Capacitated lot sizing with setup times. Management Science, 35, 353\u2013366.","journal-title":"Management Science"},{"key":"156_CR45","volume-title":"Manufacturing planning and control systems","author":"T. E. Vollmann","year":"1997","unstructured":"Vollmann, T. E., Berry, W. L., & Whybark, D. C. (1997). Manufacturing planning and control systems (4th ed.). New York: McGraw\u2013Hill.","edition":"4"},{"key":"156_CR46","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1080\/07408170600559706","volume":"38","author":"X. Zhu","year":"2006","unstructured":"Zhu, X., & Wilhelm, W. E. (2006). Scheduling and lot sizing with sequence-dependent setup: a literature review. IIE Transactions, 38, 987\u20131007.","journal-title":"IIE Transactions"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0156-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-009-0156-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-009-0156-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:44Z","timestamp":1559468384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0156-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,23]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["156"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0156-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,23]]}}}