{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:31:38Z","timestamp":1743010298441,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319894409"},{"type":"electronic","value":"9783319894416"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-89441-6_16","type":"book-chapter","created":{"date-parts":[[2018,3,30]],"date-time":"2018-03-30T09:43:23Z","timestamp":1522403003000},"page":"207-222","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-clairvoyant Scheduling to Minimize Max Flow Time on a Machine with Setup Times"],"prefix":"10.1007","author":[{"given":"Alexander","family":"M\u00e4cker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel","family":"Malatyali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Friedhelm","family":"Meyer auf der Heide","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00f6ren","family":"Riechers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,31]]},"reference":[{"issue":"2","key":"16_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.ejor.2015.04.004","volume":"246","author":"A Allahverdi","year":"2015","unstructured":"Allahverdi, A.: The third comprehensive survey on scheduling problems with setup times\/costs. Eur. J. Oper. Res. 246(2), 345\u2013378 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0305-0483(98)00042-5","volume":"27","author":"A Allahverdi","year":"1999","unstructured":"Allahverdi, A., Gupta, J.N., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27(2), 219\u2013239 (1999)","journal-title":"Omega"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1016\/j.ejor.2006.06.060","volume":"187","author":"A Allahverdi","year":"2008","unstructured":"Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187(3), 985\u20131032 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s00453-015-0082-y","volume":"77","author":"S Anand","year":"2017","unstructured":"Anand, S., Bringmann, K., Friedrich, T., Garg, N., Kumar, A.: Minimizing maximum (weighted) flow-time on related and unrelated machines. Algorithmica 77(2), 515\u2013536 (2017)","journal-title":"Algorithmica"},{"issue":"1","key":"16_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a014","volume":"12","author":"N Bansal","year":"2016","unstructured":"Bansal, N., Cloostermans, B.: Minimizing maximum flow-time on related machines. Theory Comput. 12(1), 1\u201314 (2016)","journal-title":"Theory Comput."},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/moor.1050.0170","volume":"31","author":"L Becchetti","year":"2006","unstructured":"Becchetti, L., Leonardi, S., Marchetti-Spaccamela, A., Sch\u00e4fer, G., Vredeveld, T.: Average-case and smoothed competitive analysis of the multilevel feedback algorithm. Math. Oper. Res. 31(1), 85\u2013108 (2006)","journal-title":"Math. Oper. Res."},{"key":"16_CR7","unstructured":"Bender, M.A., Chakrabarti, S., Muthukrishnan, S.: Flow and stretch metrics for scheduling continuous job streams. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1998), pp. 270\u2013279. ACM\/SIAM (1998)"},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00453-003-1036-3","volume":"37","author":"A Borodin","year":"2003","unstructured":"Borodin, A., Nielsen, M.N., Rackoff, C.: (Incremental) priority algorithms. Algorithmica 37(4), 295\u2013326 (2003)","journal-title":"Algorithmica"},{"key":"16_CR9","unstructured":"Divakaran, S., Saks, M.: An online scheduling problem with job set-ups. Technical report, DIMACS Technical Report (2000)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s00453-009-9337-9","volume":"60","author":"S Divakaran","year":"2011","unstructured":"Divakaran, S., Saks, M.E.: An online algorithm for a problem in scheduling with set-ups and release times. Algorithmica 60(2), 301\u2013315 (2011)","journal-title":"Algorithmica"},{"issue":"3","key":"16_CR11","first-page":"189","volume":"27","author":"B Hiller","year":"2012","unstructured":"Hiller, B., Vredeveld, T.: Probabilistic alternatives for competitive analysis. Comput. Sci. - R&D 27(3), 189\u2013196 (2012)","journal-title":"Comput. Sci. - R&D"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/0216029","volume":"16","author":"M Hofri","year":"1987","unstructured":"Hofri, M., Ross, K.W.: On the optimal control of two queues with server setup times and its analysis. SIAM J. Comput. 16(2), 399\u2013420 (1987)","journal-title":"SIAM J. Comput."},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-43659-3_12","volume-title":"Euro-Par 2016: Parallel Processing","author":"K Jansen","year":"2016","unstructured":"Jansen, K., Land, F.: Non-preemptive scheduling with setup times: a PTAS. In: Dutot, P.-F., Trystram, D. (eds.) Euro-Par 2016. LNCS, vol. 9833, pp. 159\u2013170. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43659-3_12"},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/S0097539796299540","volume":"30","author":"E Koutsoupias","year":"2000","unstructured":"Koutsoupias, E., Papadimitriou, C.H.: Beyond competitive analysis. SIAM J. Comput. 30(1), 300\u2013317 (2000)","journal-title":"SIAM J. Comput."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-1-4939-2864-4_13","volume-title":"Encyclopedia of Algorithms","author":"A L\u00f3pez-Ortiz","year":"2016","unstructured":"L\u00f3pez-Ortiz, A.: Alternative performance measures in online algorithms. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 67\u201372. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_13"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1007\/978-3-319-21840-3_45","volume-title":"Algorithms and Data Structures","author":"A M\u00e4cker","year":"2015","unstructured":"M\u00e4cker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S.: Non-preemptive scheduling on machines with setup times. In: Dehne, F., Sack, J.-R., Stege, U. (eds.) WADS 2015. LNCS, vol. 9214, pp. 542\u2013553. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21840-3_45"},{"key":"16_CR17","doi-asserted-by":"crossref","unstructured":"M\u00e4cker, A., Malatyali, M., Meyer auf der Heide, F., Riechers, S.: Non-clairvoyant scheduling to minimize max flow time on a machine with setup times. CoRR (2017). 1709.05896","DOI":"10.1007\/978-3-319-89441-6_16"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-540-45077-1_6","volume-title":"Fundamentals of Computation Theory","author":"M Mastrolilli","year":"2003","unstructured":"Mastrolilli, M.: Scheduling to minimize max flow time: offline and online algorithms. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 49\u201360. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45077-1_6"},{"issue":"5","key":"16_CR19","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1287\/opre.37.5.798","volume":"37","author":"CL Monma","year":"1989","unstructured":"Monma, C.L., Potts, C.N.: On the complexity of scheduling with batch setup times. Oper. Res. 37(5), 798\u2013804 (1989)","journal-title":"Oper. Res."},{"issue":"1","key":"16_CR20","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.: Non-clairvoyant scheduling. Theor. Comput. Sci. 130(1), 17\u201347 (1994)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"16_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1016\/0305-0548(91)90018-M","volume":"18","author":"CN Potts","year":"1991","unstructured":"Potts, C.N.: Scheduling two job classes on a single machine. Comput. OR 18(5), 411\u2013415 (1991)","journal-title":"Comput. OR"},{"issue":"1","key":"16_CR22","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/opre.20.1.24","volume":"20","author":"VK Sahney","year":"1972","unstructured":"Sahney, V.K.: Single-server, two-machine sequencing with switching time. Oper. Res. 20(1), 24\u201336 (1972)","journal-title":"Oper. Res."},{"issue":"1\u20133","key":"16_CR23","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.tcs.2005.04.006","volume":"341","author":"G Sch\u00e4fer","year":"2005","unstructured":"Sch\u00e4fer, G., Sivadasan, N.: Topology matters: smoothed competitiveness of metrical task systems. Theor. Comput. Sci. 341(1\u20133), 216\u2013246 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR24","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1145\/1120582.1120585","volume":"53","author":"M Scharbrodt","year":"2006","unstructured":"Scharbrodt, M., Schickinger, T., Steger, A.: A new average case analysis for completion time scheduling. J. ACM 53(1), 121\u2013146 (2006)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89441-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T12:20:48Z","timestamp":1710246048000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-89441-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319894409","9783319894416"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89441-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2017.ac.tuwien.ac.at\/waoa","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}