{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:20:38Z","timestamp":1742912438208,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030137083"},{"type":"electronic","value":"9783030137090"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-13709-0_35","type":"book-chapter","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T18:09:04Z","timestamp":1550081344000},"page":"418-430","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Processing Online SAT Instances with Waiting Time Constraints and Completion Weights"],"prefix":"10.1007","author":[{"given":"Robinson","family":"Duque","sequence":"first","affiliation":[]},{"given":"Alejandro","family":"Arbelaez","sequence":"additional","affiliation":[]},{"given":"Juan Francisco","family":"D\u00edaz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,14]]},"reference":[{"issue":"3","key":"35_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.: Online scheduling of a single machine to minimize total weighted completion time. Math. Oper. Res. 29(3), 686\u2013697 (2004)","journal-title":"Math. Oper. Res."},{"key":"35_CR2","first-page":"1","volume":"19","author":"C Angione","year":"2014","unstructured":"Angione, C., Occhipinti, A., Nicosia, G.: Satisfiability by Maxwell-Boltzmann and Bose-Einstein statistical distributions. ACM J. Exp. Algorithmics (JEA) 19, 1\u20134 (2014)","journal-title":"ACM J. Exp. Algorithmics (JEA)"},{"key":"35_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/11731177_39","volume-title":"Neural Nets","author":"V Cutello","year":"2006","unstructured":"Cutello, V., Nicosia, G.: A clonal selection algorithm for coloring, hitting set and satisfiability problems. In: Apolloni, B., Marinaro, M., Nicosia, G., Tagliaferri, R. (eds.) NAIS\/WIRN -2005. LNCS, vol. 3931, pp. 324\u2013337. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11731177_39"},{"key":"35_CR4","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-319-66562-7_38","volume-title":"Advances in Computing","author":"R Duque","year":"2017","unstructured":"Duque, R., Arbelaez, A., D\u00edaz, J.F.: Off-line and on-line scheduling of SAT instances with time processing constraints. In: Solano, A., Ordo\u00f1ez, H. (eds.) CCC 2017. CCIS, vol. 735, pp. 524\u2013539. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66562-7_38"},{"issue":"3","key":"35_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10601-018-9287-4","volume":"23","author":"R Duque","year":"2018","unstructured":"Duque, R., Arbelaez, A., D\u00edaz, J.F.: Online over time processing of combinatorial problems. Constraints 23(3), 1\u201325 (2018)","journal-title":"Constraints"},{"key":"35_CR6","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.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"issue":"2","key":"35_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/MITP.2009.40","volume":"11","author":"RL Grossman","year":"2009","unstructured":"Grossman, R.L.: The case for cloud computing. IT Prof. 11(2), 23\u201327 (2009)","journal-title":"IT Prof."},{"key":"35_CR8","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.: Algorithm runtime prediction: Methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"35_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-27926-8_23","volume-title":"Machine Learning, Optimization, and Big Data","author":"G Nicosia","year":"2015","unstructured":"Nicosia, G., Conca, P.: Characterization of the $$\\#k$$\u2013SAT problem in terms of connected components. In: Pardalos, P., Pavone, M., Farinella, G.M., Cutello, V. (eds.) MOD 2015. LNCS, vol. 9432, pp. 257\u2013268. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27926-8_23"},{"key":"35_CR10","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.: Scheduling: Theory, Algorithms, and Systems, 5th edn. Springer International Publishing, New York City (2016)","edition":"5"},{"key":"35_CR11","doi-asserted-by":"publisher","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.: Integrating queueing theory and scheduling for dynamic scheduling problems. J. Artif. Intell. Res. 50, 535\u2013572 (2014)","journal-title":"J. Artif. Intell. Res."},{"issue":"2\u20134","key":"35_CR12","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.: Distributed computing in practice: the condor experience. Concur.- Pract. Exp. 17(2\u20134), 323\u2013356 (2005)","journal-title":"Concur.- Pract. Exp."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-13709-0_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:00:06Z","timestamp":1709823606000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-13709-0_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030137083","9783030137090"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-13709-0_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 February 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Volterra","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2018.icas.xyz\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair, in-house system","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}