{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:57:50Z","timestamp":1752361070708,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10288-022-00508-2","type":"journal-article","created":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T15:07:24Z","timestamp":1653145644000},"page":"247-300","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An improved decision support model for scheduling production in an engineer-to-order manufacturer"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3566-3248","authenticated-orcid":false,"given":"St\u00e9phane","family":"Dauz\u00e8re-P\u00e9r\u00e8s","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sigrid Lise","family":"Non\u00e5s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,21]]},"reference":[{"issue":"2","key":"508_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/j.orl.2017.02.001","volume":"45","author":"C Artigues","year":"2017","unstructured":"Artigues C (2017) On the strength of time-indexed formulations for the resource-constrained project scheduling problem. Oper Res Lett 45(2):154\u2013159","journal-title":"Oper Res Lett"},{"key":"508_CR2","first-page":"663","volume":"13","author":"F Ballest\u00edn","year":"2012","unstructured":"Ballest\u00edn F, Mallor F, Mateo PM (2012) Production scheduling in a market-driven foundry: a mathematical programming approach versus a project scheduling metaheuristic algorithm. Optim Eng 13:663\u2013687","journal-title":"Optim Eng"},{"issue":"1","key":"508_CR3","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1287\/ijoc.1070.0225","volume":"20","author":"L-P Bigras","year":"2008","unstructured":"Bigras L-P, Gamache M, Savard G (2008) Time-indexed formulations and the total weighted tardiness problem. INFORMS J Comput 20(1):133\u2013142","journal-title":"INFORMS J Comput"},{"issue":"1","key":"508_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1287\/ijoc.2015.0661","volume":"28","author":"N Boland","year":"2016","unstructured":"Boland N, Clement R, Waterer H (2016) A bucket indexed formulation for nonpreemptive single machine scheduling problems. INFORMS J Comput 28(1):14\u201330","journal-title":"INFORMS J Comput"},{"issue":"1","key":"508_CR5","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/S0377-2217(98)00136-2","volume":"116","author":"Z-L Chen","year":"1999","unstructured":"Chen Z-L, Powell WB (1999a) A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. Eur J Oper Res 116(1):220\u2013232","journal-title":"Eur J Oper Res"},{"issue":"1","key":"508_CR6","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1287\/ijoc.11.1.78","volume":"11","author":"Z-L Chen","year":"1999","unstructured":"Chen Z-L, Powell WB (1999b) Solving parallel machine scheduling problems by column generation. INFORMS J Comput 11(1):78\u201394","journal-title":"INFORMS J Comput"},{"issue":"1","key":"508_CR7","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/0377-2217(94)00116-T","volume":"81","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1995","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S (1995) Minimizing late jobs in the general one machine scheduling problem. Eur J Oper Res 81(1):134\u2013142","journal-title":"Eur J Oper Res"},{"issue":"4","key":"508_CR8","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/s10951-015-0461-x","volume":"19","author":"K Deghdak","year":"2016","unstructured":"Deghdak K, T\u2019kindt V, Bouquard J-L (2016) Scheduling evacuation operations. J Sched 19(4):467\u2013478","journal-title":"J Sched"},{"issue":"6","key":"508_CR9","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s10951-010-0203-z","volume":"14","author":"B Detienne","year":"2011","unstructured":"Detienne B, Dauzere-P\u00e9res S, Yugma C (2011) Scheduling jobs on parallel machines to minimize a regular step total cost function. J Sched 14(6):523\u2013538","journal-title":"J Sched"},{"issue":"2\u20133","key":"508_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0166-218X(90)90104-K","volume":"26","author":"ME Dyer","year":"1990","unstructured":"Dyer ME, Wolsey LA (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discret Appl Math 26(2\u20133):255\u2013270","journal-title":"Discret Appl Math"},{"issue":"2","key":"508_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s11740-009-0152-6","volume":"3","author":"SK Gauri","year":"2009","unstructured":"Gauri SK (2009) Modeling product-mix planning for batches of melt under multiple objectives in a small scale iron foundry. Prod Eng Res Devel 3(2):189\u2013196","journal-title":"Prod Eng Res Devel"},{"issue":"9","key":"508_CR12","doi-asserted-by":"publisher","first-page":"2481","DOI":"10.1080\/00207543.2010.532913","volume":"49","author":"E Hans","year":"2011","unstructured":"Hans E, van de Velde S (2011) The lot sizing and scheduling of sand casting operations. Int J Prod Res 49(9):2481\u20132499","journal-title":"Int J Prod Res"},{"key":"508_CR13","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.cor.2016.04.006","volume":"73","author":"W-Y Ku","year":"2016","unstructured":"Ku W-Y, Beck JC (2016) Mixed integer programming models for job shop scheduling: a computational analysis. Comput Oper Res 73:165\u2013173","journal-title":"Comput Oper Res"},{"issue":"2","key":"508_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1287\/opre.8.2.219","volume":"8","author":"AS Manne","year":"1960","unstructured":"Manne AS (1960) On the job-shop scheduling problem. Oper Res 8(2):219\u2013223","journal-title":"Oper Res"},{"issue":"1","key":"508_CR15","first-page":"37","volume":"54","author":"G Matibevic","year":"2008","unstructured":"Matibevic G, Majdandzic N, Lovrc T (2008) Production scheduling model in aluminium foundry. Strojni\u0161ki vestnik - J Mech Eng 54(1):37\u201348","journal-title":"Strojni\u0161ki vestnik - J Mech Eng"},{"issue":"9","key":"508_CR16","doi-asserted-by":"publisher","first-page":"2351","DOI":"10.1016\/j.cor.2004.03.007","volume":"32","author":"SL Non\u00e5s","year":"2005","unstructured":"Non\u00e5s SL, Olsen KA (2005) Optimal and heuristic solutions for a scheduling problem arising in a foundry. Comput Oper Res 32(9):2351\u20132382","journal-title":"Comput Oper Res"},{"issue":"1","key":"508_CR17","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-012-1107-4","volume":"213","author":"A Obeid","year":"2014","unstructured":"Obeid A, Dauz\u00e8re-P\u00e9r\u00e8s S, Yugma C (2014) Scheduling job families on non-identical parallel machines with time constraints. Ann Oper Res 213(1):221\u2013234","journal-title":"Ann Oper Res"},{"issue":"1\u20132","key":"508_CR18","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10479-014-1776-2","volume":"249","author":"Y Pan","year":"2017","unstructured":"Pan Y, Liang Z (2017) Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems. Ann Oper Res 249(1\u20132):197\u2013213","journal-title":"Ann Oper Res"},{"key":"508_CR19","unstructured":"Queyranne M, Schulz AS (1994) Polyhedral approaches to machine scheduling. TU Berlin, Preprint, p 408"},{"key":"508_CR20","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.omega.2016.04.003","volume":"67","author":"M Sam\u00e0","year":"2017","unstructured":"Sam\u00e0 M, D\u2019Ariano A, D\u2019Ariano P, Pacciarelli D (2017) Scheduling models for optimal aircraft traffic control at busy airports: Tardiness, priorities, equity and violation considerations. Omega 67:81\u201398","journal-title":"Omega"},{"issue":"1","key":"508_CR21","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"JP Sousa","year":"1992","unstructured":"Sousa JP, Wolsey LA (1992) A time indexed formulation of non-preemptive single machine scheduling problems. Math Program 54(1):353\u2013367","journal-title":"Math Program"},{"issue":"3","key":"508_CR22","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.cie.2010.05.015","volume":"59","author":"RF Teixeira","year":"2010","unstructured":"Teixeira RF, Fernandes FCF, Pereira NA (2010) Binary integer programming formulations for scheduling in market-driven foundries. Comput Ind Eng 59(3):425\u2013435","journal-title":"Comput Ind Eng"},{"issue":"2","key":"508_CR23","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","volume":"12","author":"J van den Akker","year":"2000","unstructured":"van den Akker J, Hurkens CA, Savelsbergh MW (2000) Time-indexed formulations for machine scheduling problems: column generation. INFORMS J Comput 12(2):111\u2013124","journal-title":"INFORMS J Comput"},{"issue":"6","key":"508_CR24","doi-asserted-by":"publisher","first-page":"862","DOI":"10.1287\/opre.47.6.862","volume":"47","author":"JM van den Akker","year":"1999","unstructured":"van den Akker JM, Hoogeveen JA, van de Velde SL (1999) Parallel machine scheduling by column generation. Oper Res 47(6):862\u2013872","journal-title":"Oper Res"},{"issue":"3","key":"508_CR25","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1016\/j.ejor.2017.01.004","volume":"260","author":"S Velez","year":"2017","unstructured":"Velez S, Dong Y, Maravelias CT (2017) Changeover formulations for discrete-time mixed-integer programming scheduling models. Eur J Oper Res 260(3):949\u2013963","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00508-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10288-022-00508-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-022-00508-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T06:59:21Z","timestamp":1683788361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10288-022-00508-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["508"],"URL":"https:\/\/doi.org\/10.1007\/s10288-022-00508-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"10 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}