{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:26:25Z","timestamp":1763641585273},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_26","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"291-300","source":"Crossref","is-referenced-by-count":1,"title":["Minimizing Total Weighted Completion Time with Unexpected Machine Unavailability"],"prefix":"10.1007","author":[{"given":"Yumei","family":"Huo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris","family":"Reznichenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hairong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1007\/BF00288977","volume":"26","author":"I. Adiri","year":"1989","unstructured":"Adiri, I., Bruno, J., Frostig, E., Rinnooy Kan, A.H.G.: Single machine flowtime scheduling with a single breakdown. Acta Informatica\u00a026, 679\u2013696 (1989)","journal-title":"Acta Informatica"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-540-48413-4_27","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"S. Albers","year":"1999","unstructured":"Albers, S., Schmidt, G.: Scheduling with Unexpected Machine Breakdowns. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 269\u2013280. Springer, Heidelberg (1999)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/opre.39.1.64","volume":"39","author":"R. Arkin","year":"1991","unstructured":"Arkin, R., Roundy, R.: Weighted tardiness scheduling on parallel machines with proportional weights. Operations Research\u00a039, 64\u201381 (1991)","journal-title":"Operations Research"},{"issue":"3","key":"26_CR4","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1016\/j.ejor.2006.10.005","volume":"183","author":"J. Breit","year":"2007","unstructured":"Breit, J.: Improved approximation for non-preemptive single machine flowtime scheduling with an availability constraint. European Journal of Operational Research\u00a0183(3), 516\u2013524 (2007)","journal-title":"European Journal of Operational Research"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74466-5_23","volume-title":"Euro-Par 2007 Parallel Processing","author":"F. Diedrich","year":"2007","unstructured":"Diedrich, F., Schwarz, U.M.: A Framework for Scheduling with Online Availability. In: Kermarrec, A.-M., Boug\u00e9, L., Priol, T. (eds.) Euro-Par 2007. LNCS, vol.\u00a04641, pp. 205\u2013213. Springer, Heidelberg (2007)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Diedrich, F., Jansen, K.: Improved approximation algorithms for scheduling with fixed jobs. In: Proceeding of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 675\u2013684 (2009)","DOI":"10.1137\/1.9781611973068.74"},{"key":"26_CR7","doi-asserted-by":"publisher","first-page":"2663","DOI":"10.1016\/j.tcs.2009.03.012","volume":"410","author":"B. Fu","year":"2009","unstructured":"Fu, B., Huo, Y., Zhao, H.: Exponential inapproximability and FPTAS for scheduling with availability constraints. Theoretical Computer Science\u00a0410, 2663\u20132674 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"15","key":"26_CR8","doi-asserted-by":"publisher","first-page":"1555","DOI":"10.1016\/j.dam.2011.06.007","volume":"159","author":"B. Fu","year":"2011","unstructured":"Fu, B., Huo, Y., Zhao, H.: Approximation schemes for parallel machine scheduling with availability constraints. Discrete Applied Mathematics\u00a0159(15), 1555\u20131565 (2011)","journal-title":"Discrete Applied Mathematics"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2006.04.014","volume":"363","author":"Y. He","year":"2006","unstructured":"He, Y., Zhong, W., Gu, H.: Improved algorithms for two single machine scheduling problems. Theoretical Computer Science\u00a0363, 257\u2013265 (2006)","journal-title":"Theoretical Computer Science"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.cie.2007.08.005","volume":"54","author":"I. Kacem","year":"2008","unstructured":"Kacem, I.: Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering\u00a054, 401\u2013410 (2008)","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1080","DOI":"10.1016\/j.ejor.2006.06.062","volume":"187","author":"I. Kacem","year":"2008","unstructured":"Kacem, I., Chu, C.: Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. European Journal of Operational Research\u00a0187(3), 1080\u20131089 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"26_CR12","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1016\/j.cie.2008.09.042","volume":"56","author":"I. Kacem","year":"2009","unstructured":"Kacem, I., Mahjoub, R.: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering\u00a056(4), 1708\u20131712 (2009)","journal-title":"Computers & Industrial Engineering"},{"issue":"4","key":"26_CR13","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H. Kellerer","year":"2010","unstructured":"Kellerer, H., Strusevich, V.A.: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica\u00a057(4), 769\u2013795 (2010)","journal-title":"Algorithmica"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/BF00121681","volume":"9","author":"C.Y. Lee","year":"1996","unstructured":"Lee, C.Y.: Machine scheduling with an availability constraints. Journal of Global Optimization\u00a09, 363\u2013382 (1996)","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"26_CR15","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"C.Y. Lee","year":"1992","unstructured":"Lee, C.Y., Liman, S.D.: Single machine flow-time scheduling with scheduled maintenance. Acta Informatica\u00a029(4), 375\u2013382 (1992)","journal-title":"Acta Informatica"},{"issue":"2","key":"26_CR16","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y. Ma","year":"2010","unstructured":"Ma, Y., Chu, C., Zuo, C.: A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering\u00a058(2), 199\u2013211 (2010)","journal-title":"Computers & Industrial Engineering"},{"key":"26_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ejor.2003.08.026","volume":"161","author":"C. Sadfi","year":"2005","unstructured":"Sadfi, C., Penz, B., Rapine, C., Blazewicz, J., Formanowicz, P.: An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research\u00a0161, 3\u201310 (2005)","journal-title":"European Journal of Operational Research"},{"key":"26_CR18","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<267::AID-JOS31>3.0.CO;2-H","volume":"2","author":"M. Scharbrodt","year":"1999","unstructured":"Scharbrodt, M., Steger, A., Weisser, H.: Approximability of scheduling with fixed jobs. Journal of Scheduling\u00a02, 267\u2013284 (1999)","journal-title":"Journal of Scheduling"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0020-0190(02)00211-9","volume":"83","author":"Z. Tan","year":"2002","unstructured":"Tan, Z., He, Y.: Optimal online algorithm for scheduling on two identical machines with machine availability constraints. Information Processing Letters\u00a083, 323\u2013329 (2002)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:46Z","timestamp":1620128866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}