{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:05:17Z","timestamp":1775178317574,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T00:00:00Z","timestamp":1525392000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s10601-018-9287-4","type":"journal-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T03:37:23Z","timestamp":1525405043000},"page":"310-334","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Online over time processing of combinatorial problems"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7255-3267","authenticated-orcid":false,"given":"Robinson","family":"Duque","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Arbelaez","sequence":"additional","affiliation":[]},{"given":"Juan F.","family":"D\u00edaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,4]]},"reference":[{"issue":"3","key":"9287_CR1","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1287\/moor.1040.0092","volume":"29","author":"EJ Anderson","year":"2004","unstructured":"Anderson, E.J., & Potts, C.N. (2004). Online scheduling of a single machine to minimize total weighted completion time. Mathematics of Operations Research, 29(3), 686\u2013697.","journal-title":"Mathematics of Operations Research"},{"key":"9287_CR2","unstructured":"Arpaci-Dusseau, R.H., & Arpaci-Dusseau, A.C. (2014). Operating systems: three easy pieces, chap. Scheduling: Introduction. Arpaci-Dusseau Books."},{"key":"9287_CR3","doi-asserted-by":"crossref","unstructured":"Bartz-Beielstein, T., & Markon, S. (2004). Tuning search algorithms for real-world applications: a regression tree based approach. In Congress on evolutionary computation, 2004. CEC2004, (Vol. 1 pp. 1111\u20131118). IEEE.","DOI":"10.1109\/CEC.2004.1330986"},{"issue":"1","key":"9287_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L. (2001). Random forests. Machine Learning, 45(1), 5\u201332.","journal-title":"Machine Learning"},{"issue":"1","key":"9287_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jda.2006.07.005","volume":"6","author":"WT Chan","year":"2008","unstructured":"Chan, W.T., Chin, F.Y., Ye, D., Zhang, G., Zhang, Y. (2008). On-line scheduling of parallel jobs on two machines. Journal of Discrete Algorithms, 6(1), 3\u201310.","journal-title":"Journal of Discrete Algorithms"},{"key":"9287_CR6","doi-asserted-by":"crossref","unstructured":"Deng, K., Song, J., Ren, K., Iosup, A. (2013). Exploring portfolio scheduling for long-term execution of scientific workloads in iaas clouds. In Proceedings of the international conference on high performance computing, networking, storage and analysis (p. 55). ACM.","DOI":"10.1145\/2503210.2503244"},{"key":"9287_CR7","doi-asserted-by":"crossref","unstructured":"Deng, K., Song, J., Ren, K., Iosup, A. (2013). Exploring portfolio scheduling for long-term execution of scientific workloads in iaas clouds. In SC.","DOI":"10.1145\/2503210.2503244"},{"key":"9287_CR8","unstructured":"Deng, K., Verboon, R., Ren, K., Iosup, A. (2013). A periodic portfolio scheduler for scientific computing in the data center. In Workshop on job scheduling strategies for parallel processing (pp. 156\u2013176). Springer."},{"key":"9287_CR9","first-page":"524","volume-title":"Off-line and on-line scheduling of SAT instances with time processing constraints","author":"R Duque","year":"2017","unstructured":"Duque, R., Arbelaez, A., D\u00edaz, J.F. (2017). Off-line and on-line scheduling of SAT instances with time processing constraints, (pp. 524\u2013539). Cham: Springer International Publishing."},{"key":"9287_CR10","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.R. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"9287_CR11","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W. (2016). Solving and verifying the boolean pythagorean triples problem via cube-and-conquer. In SAT.","DOI":"10.1007\/978-3-319-40970-2_15"},{"issue":"1","key":"9287_CR12","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.orl.2007.06.001","volume":"36","author":"JL Hurink","year":"2008","unstructured":"Hurink, J.L., & Paulus, J.J. (2008). Online scheduling of parallel jobs on two machines is 2-competitive. Operations Research Letters, 36(1), 51\u201356.","journal-title":"Operations Research Letters"},{"key":"9287_CR13","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K. (2014). Algorithm runtime prediction: methods & evaluation. Artificial Intelligence, 206, 79\u2013111.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"9287_CR14","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1609\/aimag.v33i1.2395","volume":"33","author":"M J\u00e4rvisalo","year":"2012","unstructured":"J\u00e4rvisalo, M., Le Berre, D., Roussel, O., Simon, L. (2012). The international sat solver competitions. AI Magazine, 33(1), 89\u201392.","journal-title":"AI Magazine"},{"key":"9287_CR15","unstructured":"Kautz, H.A. (2006). Deconstructing planning as satisfiability. In IAAI (pp. 1524\u20131526)."},{"issue":"5","key":"9287_CR16","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/71.282559","volume":"5","author":"P Krueger","year":"1994","unstructured":"Krueger, P., Lai, T., Dixit-Radiya, V. (1994). Job scheduling is more important than processor allocation for hypercube computers. IEEE Transactions on Parallel and Distributed Systems, 5(5), 488\u2013497.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"9287_CR17","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.R., Shmoys, D.B. (1993). Sequencing and scheduling: algorithms and complexity. Handbooks in Operations Research and Management Science, 4, 445\u2013522.","journal-title":"Handbooks in Operations Research and Management Science"},{"issue":"4","key":"9287_CR18","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1538902.1538906","volume":"56","author":"K Leyton-Brown","year":"2009","unstructured":"Leyton-Brown, K., Nudelman, E., Shoham, Y. (2009). Empirical hardness models: methodology and a case study on combinatorial auctions. Journal of the ACM (JACM), 56(4), 22.","journal-title":"Journal of the ACM (JACM)"},{"key":"9287_CR19","doi-asserted-by":"crossref","unstructured":"Lynce, I., & Marques-Silva, J. (2006). SAT in bioinformatics: making the case with haplotype inference. In SAT.","DOI":"10.1007\/11814948_16"},{"key":"9287_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms, and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo, M.L. (2016). Scheduling: theory, algorithms, and systems, 5th edn. Cham: Springer International Publishing.","edition":"5th edn."},{"issue":"2","key":"9287_CR21","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/s10009-004-0183-4","volume":"7","author":"MR Prasad","year":"2005","unstructured":"Prasad, M.R., Biere, A., Gupta, A. (2005). A survey of recent advances in sat-based formal verification. STTT, 7(2), 156\u2013173.","journal-title":"STTT"},{"key":"9287_CR22","doi-asserted-by":"crossref","unstructured":"Shen, S., Deng, K., Iosup, A., Epema, D. (2013). Scheduling jobs in the cloud using on-demand and reserved instances. In European conference on parallel processing (pp. 242\u2013254). Springer.","DOI":"10.1007\/978-3-642-40047-6_27"},{"issue":"2","key":"9287_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10472-011-9230-5","volume":"61","author":"K Smith-Miles","year":"2011","unstructured":"Smith-Miles, K., & van Hemert, J.I. (2011). Discovering the suitability of optimisation algorithms by learning from evolved instances. Annals of Mathematics and Artificial Intelligence, 61(2), 87.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9287_CR24","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Kettimuthu, R., Subramani, V., Sadayappan, P. (2002). Characterization of backfilling strategies for parallel job scheduling. In ICPP workshops (pp. 514\u2013522).","DOI":"10.1109\/ICPPW.2002.1039773"},{"key":"9287_CR25","doi-asserted-by":"crossref","unstructured":"Sukhija, N., Malone, B., Srivastava, S., Banicescu, I., Ciorba, F.M. (2014). Portfolio-based selection of robust dynamic loop scheduling algorithms using machine learning. In IPDPS workshops.","DOI":"10.1109\/IPDPSW.2014.183"},{"key":"9287_CR26","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1613\/jair.4278","volume":"50","author":"D Terekhov","year":"2014","unstructured":"Terekhov, D., Tran, T.T., Down, D.G., Beck, J.C. (2014). Integrating queueing theory and scheduling for dynamic scheduling problems. Journal of Artificial Intelligence Research, 50, 535\u2013572.","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"2-4","key":"9287_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1002\/cpe.938","volume":"17","author":"D Thain","year":"2005","unstructured":"Thain, D., Tannenbaum, T., Livny, M. (2005). Distributed computing in practice: the condor experience. Concurrency - Practice and Experience, 17(2-4), 323\u2013356.","journal-title":"Concurrency - Practice and Experience"},{"issue":"4","key":"9287_CR28","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s40305-014-0060-0","volume":"2","author":"J Tian","year":"2014","unstructured":"Tian, J., Fu, R., Yuan, J. (2014). Online over time scheduling on parallel-batch machines: a survey. Journal of the Operations Research Society of China, 2(4), 445\u2013454.","journal-title":"Journal of the Operations Research Society of China"},{"key":"9287_CR29","doi-asserted-by":"crossref","unstructured":"Vielma, J.P. (2015). Mixed integer linear programming formulation techniques. SIAM Review, 57(1), 3\u201357.","DOI":"10.1137\/130915303"},{"key":"9287_CR30","volume-title":"Data mining: practical machine learning tools and techniques","author":"IH Witten","year":"2011","unstructured":"Witten, I.H., Frank, E., Hall, M.A. (2011). Data mining: practical machine learning tools and techniques, 3rd edn. San Mateo: Morgan Kaufmann.","edition":"3rd edn."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-018-9287-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-018-9287-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-018-9287-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T19:17:18Z","timestamp":1556911038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-018-9287-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,4]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["9287"],"URL":"https:\/\/doi.org\/10.1007\/s10601-018-9287-4","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,4]]},"assertion":[{"value":"4 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}