{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:22:54Z","timestamp":1759666974210},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,18]],"date-time":"2013-04-18T00:00:00Z","timestamp":1366243200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s10951-013-0328-y","type":"journal-article","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T09:47:30Z","timestamp":1366192050000},"page":"161-172","source":"Crossref","is-referenced-by-count":11,"title":["Minimizing total weighted completion time with an unexpected machine unavailable interval"],"prefix":"10.1007","volume":"17","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","published-online":{"date-parts":[[2013,4,18]]},"reference":[{"key":"328_CR1","doi-asserted-by":"crossref","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. (1989). Single machine flowtime scheduling with a single breakdown. Acta Informatica, 26, 679\u201396.","journal-title":"Acta Informatica"},{"key":"328_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/opre.39.1.64","volume":"39","author":"R Arkin","year":"1991","unstructured":"Arkin, R., & Roundy, R. (1991). Weighted tardiness scheduling on parallel machines with proportional weights. Operations Research, 39, 64\u201381.","journal-title":"Operations Research"},{"issue":"3","key":"328_CR3","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1016\/j.ejor.2006.10.005","volume":"183","author":"J Breit","year":"2007","unstructured":"Breit, J. (2007). Improved approximation for non-preemptive single machine flowtime scheduling with an availability constraint. European Journal of Operational Research, 183(3), 516\u2013524.","journal-title":"European Journal of Operational Research"},{"key":"328_CR4","doi-asserted-by":"crossref","unstructured":"Diedrich, F. & Jansen, K. (2009). Improved approximation algorithms for scheduling with fixed jobs. In Proceeding of the twentieth annual ACM-SIAM symposium on discrete algorithms (pp. 675\u2013684).","DOI":"10.1137\/1.9781611973068.74"},{"key":"328_CR5","doi-asserted-by":"crossref","unstructured":"Diedrich, F., & Schwarz, U. M. (2007). A framework for scheduling with online availability. In Proceedings of parallel processing, LNCS. (Vol. 4641, pp. 205\u2013213).","DOI":"10.1007\/978-3-540-74466-5_23"},{"key":"328_CR6","doi-asserted-by":"crossref","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. (2009). Exponential inapproximability and FPTAS for scheduling with availability constraints. Theoretical Computer Science, 410, 2663\u20132674.","journal-title":"Theoretical Computer Science"},{"issue":"15","key":"328_CR7","doi-asserted-by":"crossref","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. (2011). Approximation schemes for parallel machine scheduling with availability constraints. Discrete Applied Mathematics, 159(15), 1555\u20131565.","journal-title":"Discrete Applied Mathematics"},{"key":"328_CR8","doi-asserted-by":"crossref","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. (2006). Improved algorithms for two single machine scheduling problems. Theoretical Computer Science, 363, 257\u2013265.","journal-title":"Theoretical Computer Science"},{"key":"328_CR9","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.cie.2007.08.005","volume":"54","author":"I Kacem","year":"2008","unstructured":"Kacem, I. (2008). Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering, 54, 401\u2013410.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"328_CR10","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1016\/j.ejor.2006.06.062","volume":"187","author":"I Kacem","year":"2008","unstructured":"Kacem, I., & Chu, C. (2008). Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period. European Journal of Operational Research, 187(3), 1080\u20131089.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"328_CR11","doi-asserted-by":"crossref","first-page":"1708","DOI":"10.1016\/j.cie.2008.09.042","volume":"56","author":"I Kacem","year":"2009","unstructured":"Kacem, I., & Mahjoub, R. (2009). Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval. Computers & Industrial Engineering, 56(4), 1708\u20131712.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"328_CR12","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10951-009-0146-4","volume":"14","author":"I Kacem","year":"2011","unstructured":"Kacem, I., & Kellerer, H. (2011). Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates. Journal of Scheduling, 14(3), 257\u2013265.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"328_CR13","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1007\/s00453-008-9248-1","volume":"57","author":"H Kellerer","year":"2010","unstructured":"Kellerer, H., & Strusevich, V. A. (2010). Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications. Algorithmica, 57(4), 769\u2013795.","journal-title":"Algorithmica"},{"key":"328_CR14","first-page":"363","volume":"9","author":"CY Lee","year":"1996","unstructured":"Lee, C. Y. (1996). Machine scheduling with an availability constraints. Journal of Global Optimization, 9, 363\u2013382.","journal-title":"Journal of Global Optimization"},{"issue":"4","key":"328_CR15","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF01178778","volume":"29","author":"CY Lee","year":"1992","unstructured":"Lee, C. Y., & Liman, S. D. (1992). Single machine flow-time scheduling with scheduled maintenance. Acta Informatica, 29(4), 375\u2013382.","journal-title":"Acta Informatica"},{"issue":"2","key":"328_CR16","doi-asserted-by":"crossref","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. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58(2), 199\u2013211.","journal-title":"Computers & Industrial Engineering"},{"key":"328_CR17","doi-asserted-by":"crossref","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. (2005). An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research, 161, 3\u201310.","journal-title":"European Journal of Operational Research"},{"key":"328_CR18","doi-asserted-by":"crossref","unstructured":"Scharbrodt, M., Steger, A., & Weisser, H. (1999). Approximability of scheduling with fixed jobs. Journal of Scheduling, 2, 267\u2013284.","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<267::AID-JOS31>3.0.CO;2-H"},{"key":"328_CR19","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0020-0190(02)00211-9","volume":"83","author":"Z Tan","year":"2002","unstructured":"Tan, Z., & He, Y. (2002). Optimal online algorithm for scheduling on two identical machines with machine availability constraints. Information Processing Letters, 83, 323\u2013329.","journal-title":"Information Processing Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0328-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0328-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0328-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,12]],"date-time":"2019-07-12T14:56:10Z","timestamp":1562943370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0328-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,18]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["328"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0328-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,18]]}}}