{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:58:40Z","timestamp":1725469120575},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_8","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T18:21:08Z","timestamp":1342808468000},"page":"85-97","source":"Crossref","is-referenced-by-count":1,"title":["Online Flow Time Scheduling in the Presence of Preemption Overhead"],"prefix":"10.1007","author":[{"given":"Ho-Leung","family":"Chan","sequence":"first","affiliation":[]},{"given":"Tak-Wah","family":"Lam","sequence":"additional","affiliation":[]},{"given":"Rongbin","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"8_CR1","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. European Journal of Operational Research\u00a0187(3), 985\u20131032 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00453-006-0193-6","volume":"47","author":"N. Avrahami","year":"2007","unstructured":"Avrahami, N., Azar, Y.: Minimizing total flow time and total completion time with immediate dispatching. Algorithmica\u00a047(3), 253\u2013268 (2007)","journal-title":"Algorithmica"},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/11830924_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Bartal","year":"2006","unstructured":"Bartal, Y., Leonardi, S., Shallom, G., Sitters, R.A.: On the Value of Preemption in Scheduling. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX and RANDOM 2006. LNCS, vol.\u00a04110, pp. 39\u201348. Springer, Heidelberg (2006)"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1137\/0222078","volume":"22","author":"B. Chen","year":"1993","unstructured":"Chen, B.: A better heuristic for preemptive parallel machine scheduling with batch setup times. SIAM J. Comput.\u00a022(6), 1303\u20131318 (1993)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"8_CR5","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10951-005-6365-4","volume":"8","author":"H.A.J. Crauwels","year":"2005","unstructured":"Crauwels, H.A.J., Potts, C.N., Oudheusden, D.V., Wassenhove, L.N.V.: Branch and bound algorithms for single machine scheduling with batching to minimize the number of late jobs. J. Scheduling\u00a08(2), 161\u2013177 (2005)","journal-title":"J. Scheduling"},{"issue":"5","key":"8_CR6","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1016\/j.dam.2007.08.010","volume":"156","author":"S. Divakaran","year":"2008","unstructured":"Divakaran, S., Saks, M.E.: Approximation algorithms for problems in scheduling with set-ups. Discrete Applied Mathematics\u00a0156(5), 719\u2013729 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"8_CR7","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\u00a060(2), 301\u2013315 (2011)","journal-title":"Algorithmica"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Fox, K., Moseley, B.: Online scheduling on identical machines using srpt. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, USA, January 23-25, pp. 120\u2013128 (2011)","DOI":"10.1137\/1.9781611973082.10"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/A:1018903027868","volume":"70","author":"A. Hariri","year":"1997","unstructured":"Hariri, A., Potts, C.: Single machine scheduling with batch set-up times to minimize maximum lateness. Annals of Operations Research\u00a070, 75\u201392 (1997)","journal-title":"Annals of Operations Research"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00170-009-2190-9","volume":"47","author":"M. Heydari","year":"2010","unstructured":"Heydari, M., Sadjadi, S., Mohammadi, E.: Minimizing total flow time subject to preemption penalties in online scheduling. The International Journal of Advanced Manufacturing Technology\u00a047, 227\u2013236 (2010), doi:10.1007\/s00170-009-2190-9","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"6","key":"8_CR11","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.jcss.2006.10.018","volume":"73","author":"S. Leonardi","year":"2007","unstructured":"Leonardi, S., Raz, D.: Approximating total flow time on parallel machines. J. Comput. Syst. Sci.\u00a073(6), 875\u2013891 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"8_CR12","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0020-0190(01)00251-4","volume":"82","author":"Z. Liu","year":"2002","unstructured":"Liu, Z., Cheng, T.C.E.: Scheduling with job release dates, delivery times and preemption penalties. Inf. Process. Lett.\u00a082(2), 107\u2013111 (2002)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/B:JOSH.0000031424.35504.c4","volume":"7","author":"Z. Liu","year":"2004","unstructured":"Liu, Z., Cheng, T.C.E.: Minimizing total completion time subject to job release dates and preemption penalties. J. Scheduling\u00a07(4), 313\u2013327 (2004)","journal-title":"J. Scheduling"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1287\/opre.41.5.981","volume":"41","author":"C.L. Monma","year":"1993","unstructured":"Monma, C.L., Potts, C.N.: Analysis of heuristics for preemptive parallel machine scheduling with batch setup times. Oper. Res.\u00a041, 981\u2013993 (1993)","journal-title":"Oper. Res."},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00453-001-0068-9","volume":"32","author":"C.A. Phillips","year":"2002","unstructured":"Phillips, C.A., Stein, C., Torng, E., Wein, J.: Optimal time-critical scheduling via resource augmentation. Algorithmica\u00a032(2), 163\u2013200 (2002)","journal-title":"Algorithmica"},{"key":"8_CR16","unstructured":"Schuurman, P., Woeginger, G.J.: Preemptive scheduling with job-dependent setup times. In: SODA, pp. 759\u2013767 (1999)"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T08:05:42Z","timestamp":1620115542000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}