{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T19:09:29Z","timestamp":1780945769563,"version":"3.54.1"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T00:00:00Z","timestamp":1493164800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10479-017-2498-z","type":"journal-article","created":{"date-parts":[[2017,4,26]],"date-time":"2017-04-26T09:34:40Z","timestamp":1493199280000},"page":"437-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions"],"prefix":"10.1007","volume":"259","author":[{"given":"Simon","family":"Thevenin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"R\u00e9my","family":"Glardon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,4,26]]},"reference":[{"issue":"2","key":"2498_CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J. N., & Aldowaisan, T. (1999). A review of scheduling research involving setup considerations. Omega, 27(2), 219\u2013239.","journal-title":"Omega"},{"issue":"4","key":"2498_CR2","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1007\/s00291-009-0182-7","volume":"33","author":"H Amrani","year":"2011","unstructured":"Amrani, H., Martel, A., Zufferey, N., & Makeeva, P. (2011). A variable neighborhood search heuristic for the design of multicommodity production\u2013distribution networks with alternative facility configurations. OR Spectrum, 33(4), 989\u20131007.","journal-title":"OR Spectrum"},{"issue":"5","key":"2498_CR3","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1111\/poms.12019","volume":"22","author":"KS Azoury","year":"2013","unstructured":"Azoury, K. S., & Miyaoka, J. (2013). Managing production and distribution for supply chains in the processed food industry. Production and Operations Management, 22(5), 1250\u20131268.","journal-title":"Production and Operations Management"},{"issue":"3","key":"2498_CR4","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10951-008-0081-9","volume":"12","author":"JF Bard","year":"2009","unstructured":"Bard, J. F., & Nananukul, N. (2009). The integrated production\u2013inventory\u2013distribution\u2013routing problem. Journal of Scheduling, 12(3), 257\u2013280.","journal-title":"Journal of Scheduling"},{"key":"2498_CR5","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., Stougie, L. (1996). Multiprocessor scheduling with rejection. In: Proceedings of the seventh annual ACM-SIAM symposium on discrete algorithms (SODA\u2019 96). Philadelphia, USA."},{"issue":"1","key":"2498_CR6","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1287\/ijoc.1090.0343","volume":"22","author":"M Bierlaire","year":"2010","unstructured":"Bierlaire, M., Th\u00e9mans, M., & Zufferey, N. (2010). A heuristic for nonlinear global optimization. INFORMS Journal on Computing, 22(1), 59\u201370.","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"2498_CR7","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1007\/s00291-009-0177-4","volume":"32","author":"B Bilgen","year":"2010","unstructured":"Bilgen, B., & G\u00fcnther, H. O. (2010). Integrated production and distribution planning in the fast moving consumer goods industry: A block planning application. OR Spectrum, 32(4), 927\u2013955.","journal-title":"OR Spectrum"},{"issue":"27\u201329","key":"2498_CR8","doi-asserted-by":"crossref","first-page":"2732","DOI":"10.1016\/j.tcs.2009.04.006","volume":"410","author":"Z Cao","year":"2009","unstructured":"Cao, Z., & Yang, X. (2009). A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoretical Computer Science, 410(27\u201329), 2732\u20132745.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"2498_CR9","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.1080.0688","volume":"58","author":"ZL Chen","year":"2010","unstructured":"Chen, Z. L. (2010). Integrated production and outbound distribution scheduling: Review and extensions. Operations Research, 58(1), 130\u2013148.","journal-title":"Operations Research"},{"issue":"10","key":"2498_CR10","doi-asserted-by":"crossref","first-page":"2287","DOI":"10.1080\/00207540050028106","volume":"38","author":"AR 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(10), 2287\u20132307.","journal-title":"International Journal of Production Research"},{"issue":"11","key":"2498_CR11","doi-asserted-by":"crossref","first-page":"2987","DOI":"10.1016\/j.cor.2004.04.012","volume":"32","author":"SG Dastidar","year":"2005","unstructured":"Dastidar, S. G., & Nagi, R. (2005). Scheduling injection molding operations with multiple resource constraints and sequence dependent setup times and costs. Computers & Operations Research, 32(11), 2987\u20133005.","journal-title":"Computers & Operations Research"},{"issue":"7","key":"2498_CR12","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1080\/07408170903542649","volume":"42","author":"A Dolgui","year":"2010","unstructured":"Dolgui, A., Eremeev, A. V., Kovalyov, M. Y., & Kuznetsov, P. M. (2010). Multi-product lot sizing and scheduling on unrelated parallel machines. IIE Transactions, 42(7), 514\u2013524.","journal-title":"IIE Transactions"},{"key":"2498_CR13","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s00607-005-0130-6","volume":"76","author":"G D\u00f3sa","year":"2006","unstructured":"D\u00f3sa, G., & He, Y. (2006). Preemptive and non-preemptive on-line algorithms for scheduling with rejection on two uniform machines. Computing, 76, 149\u2013164.","journal-title":"Computing"},{"key":"2498_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00291-004-0171-9","volume":"27","author":"M Ebben","year":"2005","unstructured":"Ebben, M., Hans, E., & Olde Weghuis, F. (2005). Workload based order acceptance in job shop environments. OR Spectrum, 27, 107\u2013122.","journal-title":"OR Spectrum"},{"key":"2498_CR15","volume-title":"Handbook of Metaheuristics","year":"2010","unstructured":"Gendreau, M., & Potvin, J.-Y. (Eds.). (2010). Handbook of Metaheuristics (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"19","key":"2498_CR16","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ipl.2012.06.009","volume":"112","author":"E Gerstl","year":"2012","unstructured":"Gerstl, E., & Mosheiov, G. (2012). Scheduling on parallel identical machines with job-rejection and position-dependent processing times. Information Processing Letters, 112(19), 743\u2013747.","journal-title":"Information Processing Letters"},{"key":"2498_CR17","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/3-540-45253-2_25","volume":"1879","author":"H Hoogeveen","year":"2000","unstructured":"Hoogeveen, H., Skutella, M., & Woeginger, G. J. (2000). Preemptive scheduling with rejection. Lecture Notes in Computer Science, 1879, 268\u2013277.","journal-title":"Lecture Notes in Computer Science"},{"issue":"3","key":"2498_CR18","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(3), 1855\u20131875.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2498_CR19","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ijpe.2006.08.026","volume":"112","author":"J J\u00f3zefowska","year":"2008","unstructured":"J\u00f3zefowska, J., & Zimniak, A. (2008). Optimization tool for short-term production planning and scheduling. International Journal of Production Economics, 112(1), 109\u2013120.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"2498_CR20","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1111\/j.1937-5956.2004.tb00146.x","volume":"13","author":"S Kreipl","year":"2004","unstructured":"Kreipl, S., & Pinedo, M. (2004). Planning and scheduling in supply chains: An overview of issues in practice. Production and Operations Management, 13(1), 77\u201392.","journal-title":"Production and Operations Management"},{"issue":"4","key":"2498_CR21","doi-asserted-by":"crossref","first-page":"945","DOI":"10.1016\/j.cie.2007.11.005","volume":"54","author":"BK Lee","year":"2008","unstructured":"Lee, B. K., Kang, K. H., & Lee, Y. H. (2008). Decomposition heuristic to minimize total cost in a multi-level supply chain network. Computers & Industrial Engineering, 54(4), 945\u2013959.","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"2498_CR22","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1002\/nav.20101","volume":"52","author":"CL Li","year":"2005","unstructured":"Li, C. L., & Ou, J. (2005). Machine scheduling with pickup and delivery. Naval Research Logistics, 52(7), 617\u2013630.","journal-title":"Naval Research Logistics"},{"issue":"40\u201342","key":"2498_CR23","doi-asserted-by":"crossref","first-page":"3642","DOI":"10.1016\/j.tcs.2010.06.008","volume":"411","author":"S Li","year":"2010","unstructured":"Li, S., & Yuan, J. (2010). Parallel-machine scheduling with deteriorating jobs and rejection. Theoretical Computer Science, 411(40\u201342), 3642\u20133650.","journal-title":"Theoretical Computer Science"},{"key":"2498_CR24","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L Lu","year":"2008","unstructured":"Lu, L., Zhang, L., & Yuan, J. (2008). The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science, 396, 283\u2013289.","journal-title":"Theoretical Computer Science"},{"key":"2498_CR25","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L Lu","year":"2009","unstructured":"Lu, L., Cheng, T., Yuan, J., & Zhang, L. (2009). Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers and Operations Research, 36, 2748\u20132751.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2498_CR26","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1016\/j.ejor.2009.09.011","volume":"203","author":"RA Melo","year":"2010","unstructured":"Melo, R. A., & Wolsey, L. A. (2010). Optimizing production and transportation in a commit-to-delivery business mode. European Journal of Operational Research, 203(3), 614\u2013618.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2498_CR27","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(2), 277\u2013292.","journal-title":"European Journal of Operational Research"},{"key":"2498_CR28","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search. Computers & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2498_CR29","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ijpe.2010.02.002","volume":"125","author":"C O\u011fuz","year":"2010","unstructured":"O\u011fuz, C., Salman, S. F., & Yal\u00e7\u0131n, B. Z. (2010). Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics, 125(1), 200\u2013211.","journal-title":"International Journal of Production Economics"},{"key":"2498_CR30","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/S0304-3975(00)00288-7","volume":"262","author":"SS Seiden","year":"2001","unstructured":"Seiden, S. S. (2001). Preemptive multiprocessor scheduling with rejection. Theoretical Computer Science, 262, 437\u2013458.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2498_CR31","first-page":"175","volume":"4","author":"N Shirvani","year":"2013","unstructured":"Shirvani, N., & Shadrokh, S. (2013). Coordination of a cyclic three-stage supply chain for fast moving consumer goods. Iranian Journal of Operations Research, 4(2), 175\u2013190.","journal-title":"Iranian Journal of Operations Research"},{"issue":"1","key":"2498_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1\u201311.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2498_CR33","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.ejor.2004.03.001","volume":"163","author":"H Stadtler","year":"2005","unstructured":"Stadtler, H. (2005). Supply chain management and advanced planning\u2014basics, overview and challenges. European Journal of Operational Research, 163(3), 575\u2013588.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2498_CR34","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1287\/msom.1060.0138","volume":"9","author":"KE Stecke","year":"2007","unstructured":"Stecke, K. E., & Zhao, X. (2007). Production and transportation integration for a make-to-order manufacturing company with a commit-to-delivery business mode. Manufacturing & Service Operations Management, 9(2), 206\u2013224.","journal-title":"Manufacturing & Service Operations Management"},{"key":"2498_CR35","unstructured":"Thevenin, S., Zufferey, N. (2014). Variable neighborhood search for a scheduling problem with time window penalties. In: Proceedings of the 14th international workshop on project management and scheduling (PMS), Munchen, Germany."},{"issue":"1","key":"2498_CR36","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0925-5273(94)90014-0","volume":"37","author":"HA Kate ten","year":"1994","unstructured":"ten Kate, H. A. (1994). Towards a better understanding of order acceptance. International Journal of Production Economics, 37(1), 139\u2013152.","journal-title":"International Journal of Production Economics"},{"issue":"8","key":"2498_CR37","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1002\/nav.20116","volume":"52","author":"H Wang","year":"2005","unstructured":"Wang, H., & Lee, C. Y. (2005). Production and transport logistics scheduling with two transport mode choices. Naval Research Logistics, 52(8), 796\u2013809.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"2498_CR38","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1016\/j.ejor.2007.12.033","volume":"194","author":"X Wang","year":"2009","unstructured":"Wang, X., & Cheng, T. (2009). Production scheduling with supply and delivery considerations to minimize the makespan. European Journal of Operational Research, 194(3), 743\u2013752.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2498_CR39","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.orl.2009.11.007","volume":"38","author":"W Zhong","year":"2010","unstructured":"Zhong, W., Chen, Z. L., & Chen, M. (2010). Integrated production and distribution scheduling with committed delivery dates. Operations Research Letters, 38(2), 133\u2013138.","journal-title":"Operations Research Letters"},{"issue":"11","key":"2498_CR40","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(11), 987\u20131007.","journal-title":"IIE transactions"},{"key":"2498_CR41","first-page":"446","volume":"3","author":"N Zufferey","year":"2012","unstructured":"Zufferey, N. (2012). Metaheuristics: Some principles for an efficient design. Computer Technology and Applications, 3, 446\u2013462.","journal-title":"Computer Technology and Applications"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-017-2498-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2498-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-017-2498-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:30:28Z","timestamp":1750206628000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-017-2498-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,4,26]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["2498"],"URL":"https:\/\/doi.org\/10.1007\/s10479-017-2498-z","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,4,26]]}}}