{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T17:24:05Z","timestamp":1774373045044,"version":"3.50.1"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T00:00:00Z","timestamp":1562198400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T00:00:00Z","timestamp":1562198400000},"content-version":"vor","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":[[2020,2]]},"DOI":"10.1007\/s10479-019-03298-9","type":"journal-article","created":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T14:21:54Z","timestamp":1562250114000},"page":"197-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Modeling single machine preemptive scheduling problems for computational efficiency"],"prefix":"10.1007","volume":"285","author":[{"given":"Fernando","family":"Jaramillo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Busra","family":"Keles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9626-1592","authenticated-orcid":false,"given":"Murat","family":"Erkoc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,4]]},"reference":[{"issue":"1","key":"3298_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.3934\/jimo.2014.10.219","volume":"10","author":"MO Adamu","year":"2014","unstructured":"Adamu, M. O., & Adewumi, A. O. (2014). A survey of single machine scheduling to minimize wieighted number of tardy jobs. Journal of Industrial and Management Optimization, 10(1), 219\u2013241.","journal-title":"Journal of Industrial and Management Optimization"},{"key":"3298_CR2","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/S0167-6377(98)00045-5","volume":"24","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P. (1999). An O$$(n^4)$$ algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Operations Research Letters, 24, 175\u2013180.","journal-title":"Operations Research Letters"},{"key":"3298_CR3","unstructured":"Batsyn, M., Goldengorin, B., Sukov, P., & Pardalos, P. M. (2013). Models, Algorithms, and technologies for network analysis. In Springer proceedings in mathematics & statistics, chap Lower and upper bounds for the preemptive single machine scheduling problem with equal processing times (vol.\u00a059, pp. 11\u201327). Springer."},{"issue":"3","key":"3298_CR4","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/0166-218X(92)90255-9","volume":"36","author":"H Belouadah","year":"1992","unstructured":"Belouadah, H., Posner, M. E., & Chris, C. N. (1992). Scheduling with release dates on a single machine to minimize total weighted completion time. Discrete Applied Mathematics, 36(3), 213\u2013231.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"3298_CR5","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1016\/j.orl.2015.02.011","volume":"43","author":"L Berghman","year":"2015","unstructured":"Berghman, L., & Spieksma, F. C. R. (2015). Valid inequalities for a time-indexed formulation. Operations Research Letters, 43(3), 268\u2013272.","journal-title":"Operations Research Letters"},{"issue":"1","key":"3298_CR6","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 Journal of Computing, 28(1), 14\u201330.","journal-title":"INFORMS Journal of Computing"},{"key":"3298_CR7","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10951-007-0028-6","volume":"10","author":"K Bulbul","year":"2007","unstructured":"Bulbul, K., Kaminsky, P., & Yano, C. (2007). Preemption in single machine earliness\/tardiness scheduling. Journal of Scheduling, 10, 271\u2013292.","journal-title":"Journal of Scheduling"},{"key":"3298_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"3298_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0166-218X(83)90019-7","volume":"5","author":"A Hariri","year":"1983","unstructured":"Hariri, A., & Potts, C. N. (1983). An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discrete Applied Mathematics, 5(1), 99\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"3298_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.disopt.2008.08.001","volume":"6","author":"Y Hendel","year":"2009","unstructured":"Hendel, Y., Runge, N., & Sourd, F. (2009). The one-machine just-in-time scheduling problem with preemption. Discrete Optimization, 6, 10\u201322.","journal-title":"Discrete Optimization"},{"key":"3298_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.cie.2017.03.012","volume":"107","author":"F Jaramillo","year":"2017","unstructured":"Jaramillo, F., & Erkoc, M. (2017). Minimizing total weighted tardiness and overtime costs for single machine preemptive scheduling. Computers & Industrial Engineering, 107, 109\u2013119.","journal-title":"Computers & Industrial Engineering"},{"key":"3298_CR12","doi-asserted-by":"crossref","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In Complexity of computer computations (pp. 85\u2013103). Springer.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"3298_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2009.04.007","volume":"202","author":"C Koulamas","year":"2010","unstructured":"Koulamas, C. (2010). The single-machine total tardiness scheduling problem: Review and extensions. European Journal of Operational Research, 202(1), 1\u20137.","journal-title":"European Journal of Operational Research"},{"key":"3298_CR14","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/B978-0-12-566780-7.50020-9","volume-title":"Progress in combinatorial optimization","author":"J Labetoulle","year":"1984","unstructured":"Labetoulle, J., Lawler, E. L., Lenstra, J., & Rinnooy, K. A. (1984). Progress in combinatorial optimization (pp. 245\u2013261). NewYork: Academic Press."},{"issue":"1\u20134","key":"3298_CR15","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"EL Lawler","year":"1990","unstructured":"Lawler, E. L. (1990). A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research, 26(1\u20134), 125\u2013133.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3298_CR16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0895-7177(94)90209-7","volume":"20","author":"EM Lawler","year":"1994","unstructured":"Lawler, E. M. (1994). Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the \u2019tower of sets\u2019 property. Mathematical and Computer Modelling, 20(2), 91\u2013106.","journal-title":"Mathematical and Computer Modelling"},{"key":"3298_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra, J. K., Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Annals of Discrete Mathematics, 1, 343\u2013362.","journal-title":"Annals of Discrete Mathematics"},{"key":"3298_CR18","first-page":"119","volume":"103","author":"JYT Leung","year":"2007","unstructured":"Leung, J. Y. T., Li, H., Pinedo, M., & Zhang, J. (2007). Minimizing total weighted completion time when scheduling orders in a flexible environment with uniform machines. Information Pr, 103, 119\u2013129.","journal-title":"Information Pr"},{"issue":"3","key":"3298_CR19","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","volume":"96","author":"G Li","year":"1997","unstructured":"Li, G. (1997). Single machine earliness and tardiness scheduling. European Journal of Operational Research, 96(3), 546\u2013558.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"3298_CR20","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1016\/j.cie.2007.01.004","volume":"52","author":"CJ Liao","year":"2007","unstructured":"Liao, C. J., & Cheng, C. C. (2007). A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date. Computers & Industrial Engineering, 52(4), 404\u2013413.","journal-title":"Computers & Industrial Engineering"},{"issue":"7","key":"3298_CR21","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","volume":"26","author":"CF Liaw","year":"1999","unstructured":"Liaw, C. F. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers & Operations Research, 26(7), 679\u2013693.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"3298_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R McNaughton","year":"1959","unstructured":"McNaughton, R. (1959). Scheduling with deadlines and loss functions. Management Science, 6(1), 1\u201312.","journal-title":"Management Science"},{"issue":"2","key":"3298_CR23","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.ejor.2005.08.013","volume":"176","author":"R M\u2019Hallah","year":"2007","unstructured":"M\u2019Hallah, R., & Bulfin, R. L. (2007). Minimizing the weighted number of tardy jobs on a single machine with release days. European Journal of Operational Research, 176(2), 727\u2013744.","journal-title":"European Journal of Operational Research"},{"key":"3298_CR24","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","volume":"2","author":"A Pessoa","year":"2010","unstructured":"Pessoa, A., Uchoa, E., de Aragao, M. P., & Rodrigues, R. (2010). Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems. Mathematical Programming Comput, 2, 259\u2013290.","journal-title":"Mathematical Programming Comput"},{"key":"3298_CR25","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1002\/jos.93","volume":"5","author":"AS Schulz","year":"2002","unstructured":"Schulz, A. S., & Skutella, M. (2002). The power of $$\\alpha $$ -points in preemptive single machine scheduling. Journal of Scheduling, 5, 121\u2013133.","journal-title":"Journal of Scheduling"},{"key":"3298_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0925-5273(02)00265-7","volume":"83","author":"T Sen","year":"2003","unstructured":"Sen, T., Sulek, J., & Dileepan, P. (2003). Static scheduling research to minimize wieghted and unweighted tardiness: A state-of-the-art survey. International Journal of Production Economics, 83, 1\u201312.","journal-title":"International Journal of Production Economics"},{"key":"3298_CR27","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/j.orl.2010.08.012","volume":"38","author":"R Sitters","year":"2010","unstructured":"Sitters, R. (2010). Competitive analysis of preemptive single-machine scheduling. Operations Research Letters, 38, 585\u2013588.","journal-title":"Operations Research Letters"},{"key":"3298_CR28","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01586059","volume":"54","author":"JP Sousa","year":"1992","unstructured":"Sousa, J. P., & Wolsey, L. A. (1992). A time indexed formulation of non-preemptive single machine scheduling problems. Mathematical Programming, 54, 353\u2013367.","journal-title":"Mathematical Programming"},{"issue":"4","key":"3298_CR29","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10951-006-7039-6","volume":"9","author":"Z Tian","year":"2006","unstructured":"Tian, Z., Ng, C. T., & Cheng, T. C. E. (2006). An O$$(n^2)$$ algorithm for scheduling equal-length preemptive jobs on a simgle machine to minimize total tardiness. Journal of Scheduling, 9(4), 343\u2013364.","journal-title":"Journal of Scheduling"},{"key":"3298_CR30","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.orl.2009.04.004","volume":"37","author":"Z Tian","year":"2009","unstructured":"Tian, Z., Ng, C. T., & Cheng, T. C. E. (2009). Preemptive scheduling of jobs with agreeable due date on a single machine to minimize total tardiness. Operations Research Letters, 37, 368\u2013374.","journal-title":"Operations Research Letters"},{"issue":"1\u20134","key":"3298_CR31","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1023\/A:1010958200070","volume":"102","author":"M Vanhoucke","year":"2001","unstructured":"Vanhoucke, M., Demeulemeester, E., & Herroelen, W. (2001). An exact procedure for the resource-constrained weighted earliness-tardiness project scheduling problem. Annals of Operations Research, 102(1\u20134), 179\u2013196.","journal-title":"Annals of Operations Research"},{"key":"3298_CR32","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10479-004-5032-z","volume":"133","author":"G Wang","year":"2005","unstructured":"Wang, G., Sun, H., & Chu, C. (2005). Preemptive scheduling with availability constraints to minimize total weighted completion times. Annals of Operations Research, 133, 183\u2013192.","journal-title":"Annals of Operations Research"},{"key":"3298_CR33","doi-asserted-by":"publisher","first-page":"1273","DOI":"10.1016\/S0305-0548(03)00080-7","volume":"31","author":"B Yang","year":"2004","unstructured":"Yang, B., Geunes, J., & O\u2019Brien, W. (2004). A heuristic approach for minimizing weighted tardiness and overtime costs in single resource scheduling. Computers and Operations Research, 31, 1273\u20131301.","journal-title":"Computers and Operations Research"},{"issue":"2","key":"3298_CR34","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(91)90078-A","volume":"52","author":"CA Yano","year":"1991","unstructured":"Yano, C. A., & Kim, Y. D. (1991). Algorithms for a class of single-machine weighted tardiness and earliness problems. European Journal of Operational Research, 52(2), 167\u2013178.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"3298_CR35","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.ejor.2003.10.043","volume":"164","author":"J Yuan","year":"2005","unstructured":"Yuan, J., & Lin, Y. (2005). Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria. European Journal of Operational Research, 164(3), 851\u2013855.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03298-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-019-03298-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-019-03298-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,2]],"date-time":"2020-07-02T23:37:51Z","timestamp":1593733071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-019-03298-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,4]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["3298"],"URL":"https:\/\/doi.org\/10.1007\/s10479-019-03298-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,4]]},"assertion":[{"value":"4 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}