{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T16:21:00Z","timestamp":1772468460882,"version":"3.50.1"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031327254","type":"print"},{"value":"9783031327261","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_18","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"246-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Competitive Kill-and-Restart and\u00a0Preemptive Strategies for\u00a0Non-clairvoyant Scheduling"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7003-1430","authenticated-orcid":false,"given":"Sven","family":"J\u00e4ger","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6910-8907","authenticated-orcid":false,"given":"Guillaume","family":"Sagnol","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9331-445X","authenticated-orcid":false,"given":"Daniel","family":"Schmidt genannt Waldschmidt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2878-6872","authenticated-orcid":false,"given":"Philipp","family":"Warode","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","unstructured":"Afrati, F., et al.: Approximation schemes for minimizing average weighted completion time with release dates. In: 40th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 32\u201343. IEEE (1999). https:\/\/doi.org\/10.1109\/SFFCS.1999.814574","DOI":"10.1109\/SFFCS.1999.814574"},{"issue":"3","key":"18_CR2","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). https:\/\/doi.org\/10.1287\/moor.1040.0092","journal-title":"Math. Oper. Res."},{"issue":"2","key":"18_CR3","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1006\/inco.1993.1054","volume":"106","author":"RA Baeza-Yates","year":"1993","unstructured":"Baeza-Yates, R.A., Culberson, J.C., Rawlins, G.J.E.: Searching in the plane. Inf. Comput. 106(2), 234\u2013252 (1993). https:\/\/doi.org\/10.1006\/inco.1993.1054","journal-title":"Inf. Comput."},{"key":"18_CR4","doi-asserted-by":"publisher","unstructured":"Bansal, N., Dhamdhere, K.: Minimizing weighted flow time. ACM Trans. Algorithms 3(4), 39:1\u201339:14 (2007). https:\/\/doi.org\/10.1145\/1290672.1290676","DOI":"10.1145\/1290672.1290676"},{"key":"18_CR5","doi-asserted-by":"publisher","unstructured":"Bansal, N., Pruhs, K.: Server scheduling in the weighted $${\\ell }_{p}$$-norm. In: Farach-Colton, Mart\u00edn (ed.) LATIN 2004. LNCS, vol. 2976, pp. 434\u2013443. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_47","DOI":"10.1007\/978-3-540-24698-5_47"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Beaumont, O., Bonichon, N., Eyraud-Dubois, L., Marchal, L.: Minimizing weighted mean completion time for malleable tasks scheduling. In: 26th International Symposium on Parallel and Distributed Processing (IPDPS), pp. 273\u2013284. IEEE (2012). https:\/\/doi.org\/10.1109\/ipdps.2012.34","DOI":"10.1109\/ipdps.2012.34"},{"issue":"4","key":"18_CR7","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1145\/1008731.1008732","volume":"51","author":"L Becchetti","year":"2004","unstructured":"Becchetti, L., Leonardi, S.: Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines. J. ACM 51(4), 517\u2013539 (2004). https:\/\/doi.org\/10.1145\/1008731.1008732","journal-title":"J. ACM"},{"key":"18_CR8","volume-title":"Theory of Scheduling","author":"RW Conway","year":"1967","unstructured":"Conway, R.W., Maxwell, W.L., Miller, L.W.: Theory of Scheduling. Addison-Wesley Publishing Company, Boston (1967)"},{"issue":"1","key":"18_CR9","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/S0304-3975(02)00488-7","volume":"299","author":"L Epstein","year":"2003","unstructured":"Epstein, L., van Stee, R.: Lower bounds for on-line single-machine scheduling. Theor. Comput. Sci. 299(1), 439\u2013450 (2003). https:\/\/doi.org\/10.1016\/S0304-3975(02)00488-7","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","volume":"130","author":"A Feldmann","year":"1994","unstructured":"Feldmann, A., Sgall, J., Teng, S.H.: Dynamic scheduling on parallel machines. Theor. Comput. Sci. 130(1), 49\u201372 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90152-X","journal-title":"Theor. Comput. Sci."},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Garg, N., Gupta, A., Kumar, A., Singla, S.: Non-clairvoyant precedence constrained scheduling. In: Baier, C., Chatzigiannakis, I., Flocchini, P., Leonardi, S. (eds.) 46th International Colloquium on Automata, Languages, and Programming (ICALP). LIPIcs, vol. 132, pp. 63:1\u201363:14 (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.63","DOI":"10.4230\/LIPIcs.ICALP.2019.63"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-61310-2_22","volume-title":"Integer Programming and Combinatorial Optimization","author":"MX Goemans","year":"1996","unstructured":"Goemans, M.X.: A supermodular relaxation for scheduling with release dates. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 288\u2013300. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61310-2_22"},{"key":"18_CR13","unstructured":"Goemans, M.X.: Improved approximation algorthims for scheduling with release dates. In: Proceedings of the Eighth Annual ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 591\u2013598. SIAM (1997)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-61310-2_30","volume-title":"Integer Programming and Combinatorial Optimization","author":"JA Hoogeveen","year":"1996","unstructured":"Hoogeveen, J.A., Vestjens, A.P.A.: Optimal on-line algorithms for single-machine scheduling. In: Cunningham, W.H., McCormick, S.T., Queyranne, M. (eds.) IPCO 1996. LNCS, vol. 1084, pp. 404\u2013414. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61310-2_30"},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3136754","volume":"65","author":"S Im","year":"2017","unstructured":"Im, S., Kulkarni, J., Munagala, K.: Competitive algorithms from competitive equilibria: non-clairvoyant scheduling under polyhedral constraints. J. ACM 65(1), 1\u201333 (2017). https:\/\/doi.org\/10.1145\/3136754","journal-title":"J. ACM"},{"key":"18_CR16","doi-asserted-by":"publisher","unstructured":"Im, S., Kulkarni, J., Munagala, K., Pruhs, K.: SelfishMigrate: A scalable algorithm for non-clairvoyantly scheduling heterogeneous processors. In: 55th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 531\u2013540 (2014). https:\/\/doi.org\/10.1109\/FOCS.2014.63","DOI":"10.1109\/FOCS.2014.63"},{"key":"18_CR17","doi-asserted-by":"publisher","unstructured":"J\u00e4ger, S., Sagnol, G., Schmidt genannt Waldschmidt, D., Warode, P.: Competitive kill-and-restart and preemptive strategies for non-clairvoyant scheduling (2022). https:\/\/doi.org\/10.48550\/ARXIV.2211.02044","DOI":"10.48550\/ARXIV.2211.02044"},{"issue":"4","key":"18_CR18","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1145\/347476.347479","volume":"47","author":"B Kalyanasundaram","year":"2000","unstructured":"Kalyanasundaram, B., Pruhs, K.: Speed is as powerful as clairvoyance. J. ACM 47(4), 617\u2013643 (2000). https:\/\/doi.org\/10.1145\/347476.347479","journal-title":"J. ACM"},{"issue":"1","key":"18_CR19","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1006\/jagm.1998.0959","volume":"29","author":"MY Kao","year":"1998","unstructured":"Kao, M.Y., Ma, Y., Sipser, M., Yin, Y.: Optimal constructions of hybrid algorithms. J. Alg. 29(1), 142\u2013164 (1998). https:\/\/doi.org\/10.1006\/jagm.1998.0959","journal-title":"J. Alg."},{"issue":"1","key":"18_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1006\/inco.1996.0092","volume":"131","author":"MY Kao","year":"1996","unstructured":"Kao, M.Y., Reif, J.H., Tate, S.R.: Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem. Inf. Comput. 131(1), 63\u201379 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0092","journal-title":"Inf. Comput."},{"issue":"1","key":"18_CR21","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0020-0190(03)00231-X","volume":"87","author":"J Kim","year":"2003","unstructured":"Kim, J., Chwa, K.: Non-clairvoyant scheduling for weighted flow time. Inf. Process. Lett. 87(1), 31\u201337 (2003). https:\/\/doi.org\/10.1016\/S0020-0190(03)00231-X","journal-title":"Inf. Process. Lett."},{"key":"18_CR22","doi-asserted-by":"publisher","unstructured":"Labetoulle, J., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of uniform machines subject to release dates. In: Pulleyblank, W.R. (ed.) Progress in Combinatorial Optimization, pp. 245\u2013261. Academic Press (1984). https:\/\/doi.org\/10.1016\/B978-0-12-566780-7.50020-9","DOI":"10.1016\/B978-0-12-566780-7.50020-9"},{"key":"18_CR23","doi-asserted-by":"publisher","unstructured":"Lindermayr, A., Megow, N.: Permutation predictions for non-clairvoyant scheduling. In: Proceedings of the 34th Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 357\u2013368 (2022). https:\/\/doi.org\/10.1145\/3490148.3538579","DOI":"10.1145\/3490148.3538579"},{"issue":"4","key":"18_CR24","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1287\/moor.2014.0653","volume":"39","author":"N Megow","year":"2014","unstructured":"Megow, N., Vredeveld, T.: A tight 2-approximation for preemptive stochastic scheduling. Math. Oper. Res. 39(4), 1297\u20131310 (2014). https:\/\/doi.org\/10.1287\/moor.2014.0653","journal-title":"Math. Oper. Res."},{"issue":"1","key":"18_CR25","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0304-3975(94)90151-1","volume":"130","author":"R Motwani","year":"1994","unstructured":"Motwani, R., Phillips, S., Torng, E.: Nonclairvoyant scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90151-1","journal-title":"Theor. Comput. Sci."},{"key":"18_CR26","doi-asserted-by":"publisher","unstructured":"Rinnooy Kan, A.H.G.: Machine Scheduling Problems: Classification, Complexity and Computations. Martinus Nijhoff (1976). https:\/\/doi.org\/10.1007\/978-1-4613-4383-7","DOI":"10.1007\/978-1-4613-4383-7"},{"issue":"6","key":"18_CR27","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539793248317","volume":"24","author":"DB Shmoys","year":"1995","unstructured":"Shmoys, D.B., Wein, J., Williamson, D.P.: Scheduling parallel machines on-line. SIAM J. Comput. 24(6), 1313\u20131331 (1995). https:\/\/doi.org\/10.1137\/S0097539793248317","journal-title":"SIAM J. Comput."},{"issue":"6","key":"18_CR28","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.: Competitive analysis of preemptive single-machine scheduling. Oper. Res. Lett. 38(6), 585\u2013588 (2010). https:\/\/doi.org\/10.1016\/j.orl.2010.08.012","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"18_CR29","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Nav. Res. Logist. Q. 3(1\u20132), 59\u201366 (1956). https:\/\/doi.org\/10.1002\/nav.3800030106","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"18_CR30","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jalgor.2004.10.001","volume":"57","author":"R van Stee","year":"2005","unstructured":"van Stee, R., La Poutr\u00e9, H.: Minimizing the total completion time on-line on a single machine, using restarts. J. Alg. 57(2), 95\u2013129 (2005). https:\/\/doi.org\/10.1016\/j.jalgor.2004.10.001","journal-title":"J. Alg."},{"key":"18_CR31","doi-asserted-by":"publisher","unstructured":"Vestjens, A.P.A.: On-line machine scheduling. Ph.D. thesis, Technische Universiteit Eindhoven (1997). https:\/\/doi.org\/10.6100\/IR500043, https:\/\/pure.tue.nl\/ws\/files\/1545064\/500043.pdf","DOI":"10.6100\/IR500043"},{"key":"18_CR32","doi-asserted-by":"publisher","unstructured":"Yao, A.C.C.: Probabilistic computations: toward a unified measure of complexity. In: 18th Annual IEEE Symposium on Foundations of Computer Science (SFCS), pp. 222\u2013227 (1977). https:\/\/doi.org\/10.1109\/SFCS.1977.24","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:30:31Z","timestamp":1684701031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"33","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":"28% - 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":"3","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":"2","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)"}}]}}