{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:31Z","timestamp":1759638151191},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T00:00:00Z","timestamp":1418947200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10951-014-0411-z","type":"journal-article","created":{"date-parts":[[2014,12,19]],"date-time":"2014-12-19T06:57:56Z","timestamp":1418972276000},"page":"561-573","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Real-time scheduling to minimize machine busy times"],"prefix":"10.1007","volume":"18","author":[{"given":"Rohit","family":"Khandekar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,19]]},"reference":[{"key":"411_CR1","unstructured":"Bar-Yehuda, R., Bar-Noy, A., Freund, A., Naor, J., & Schieber, B. (2000). A unified approach to approximating resource allocation and scheduling. Journal of the ACM, 1\u201323."},{"key":"411_CR2","doi-asserted-by":"crossref","unstructured":"Belede, L., Jain, A., & Reddy Gaddam, R. (2009). Unit commitment with nature and biologically inspired computing. In World congress on nature and biologically inspired computing (NABIC) (pp. 824\u2013829).","DOI":"10.1109\/NABIC.2009.5393580"},{"key":"411_CR3","doi-asserted-by":"crossref","unstructured":"Bhatia, S., Chuzhoy, J., Freund, A., & Naor, J. (2007). Algorithmic aspects of bandwidth trading. ACM Transactions on Algorithms, 3(1).","DOI":"10.1145\/1186810.1186820"},{"key":"411_CR4","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.","edition":"5"},{"issue":"4","key":"411_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2000807.2000816","volume":"7","author":"G Calinescu","year":"2011","unstructured":"Calinescu, G., Chakrabarti, A., Karloff, H., & Rabani, Y. (2011). An improved approximation algorithms for resource allocation. ACM Transactions on Algorithms, 7(4), 1\u20137.","journal-title":"ACM Transactions on Algorithms"},{"key":"411_CR6","doi-asserted-by":"crossref","unstructured":"Chang, J., Khuller, S., & Mukherjee, K. (2014). LP rounding and combinatorial algorithms for minimizing active and busy time. In 26th ACM symposium on parallelism in algorithms and architectures (SPAA).","DOI":"10.1145\/2612669.2612689"},{"key":"411_CR7","first-page":"501","volume":"34","author":"B Chen","year":"2002","unstructured":"Chen, B., Hassin, R., & Tzur, M. (2002). Allocation of bandwidth and storage. IIE Transactions, 34, 501\u2013507.","journal-title":"IIE Transactions"},{"key":"411_CR8","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J Edmonds","year":"1965","unstructured":"Edmonds, J. (1965). Paths, trees and flowers. Canadian Journal of Mathematics, 17, 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"issue":"40\u201342","key":"411_CR9","doi-asserted-by":"crossref","first-page":"3553","DOI":"10.1016\/j.tcs.2010.05.011","volume":"411","author":"M Flammini","year":"2010","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., et al. (2010). Minimizing total busy time in parallel scheduling with application to optical networks. Theoretical Computer Science, 411(40\u201342), 3553\u20133562.","journal-title":"Theoretical Computer Science"},{"key":"411_CR10","doi-asserted-by":"crossref","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shalom, M., & Zaks, S. (2008). Approximating the traffic grooming problem with respect to ADMs and OADMs. In 14th Euro-Par.","DOI":"10.1007\/978-3-540-85451-7_99"},{"key":"411_CR11","unstructured":"Gerstel, O., Ramaswami, R., & Sasaki, G. (1998). In INFOCOM: Sasaki. Cost effective traffic grooming in wdm rings."},{"key":"411_CR12","doi-asserted-by":"crossref","unstructured":"Kang, J., Ranka, S. (2008). Energy-efficient dynamic scheduling on parallel machines. In High performance computing (HiPC) (pp. 208\u2013219).","DOI":"10.1007\/978-3-540-89894-8_21"},{"key":"411_CR13","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T. (2010) Minimizing busy time in multiple machine real-time scheduling. In Foundations of software technology and theoretical computer science (FSTTCS) (pp. 169\u2013180)."},{"issue":"2","key":"411_CR14","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178(2), 331\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"411_CR15","unstructured":"Lawler, E., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. (1993). Sequencing and scheduling: Algorithms and complexity. In: S. C. Graves, A. H. G. Rinnooy Kan, P. Zipkin (Eds.). Handbooks in operations research and management science (Vol. 4)."},{"key":"411_CR16","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","year":"2004","unstructured":"Leung, J. Y.-T. (Ed.). (2004). Handbook of scheduling: algorithms, models, and performance analysis. Boca Raton, FL: CRC Press."},{"key":"411_CR17","unstructured":"Ludwig, W. T. (1995). Algorithms for scheduling malleable and nonmalleable parallel tasks. PhD thesis, Dept. of Computer Science, Univ. of Wisconsin - Madison."},{"issue":"2","key":"411_CR18","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TVLSI.2003.810801","volume":"11","author":"A Manzak","year":"2003","unstructured":"Manzak, A., & Chakrabarti, C. (2003). Variable voltage task scheduling algorithms for minimizing energy\/power. IEEE Transaction on VLSI Systems, 11(2), 501\u2013507.","journal-title":"IEEE Transaction on VLSI Systems"},{"key":"411_CR19","doi-asserted-by":"crossref","unstructured":"Mertzios, G. B., Shalom, M., Voloshin, A., Wong, P. W. H., & Zaks, S. (2012). Optimizing busy time on parallel machines. In IEEE International Parallel and Distributed Processing Symposium (IPDPS) (pp. 238\u2013248).","DOI":"10.1109\/IPDPS.2012.31"},{"key":"411_CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/1099-1425(200011\/12)3:6<365::AID-JOS56>3.0.CO;2-P","volume":"3","author":"CA Phillips","year":"2000","unstructured":"Phillips, C. A., Uma, R. N., & Wein, J. (2000). Off-line admission control for general scheduling problems. Journal of Scheduling, 3, 365\u2013381.","journal-title":"Journal of Scheduling"},{"key":"411_CR21","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems. Berlin: Springer."},{"key":"411_CR22","unstructured":"Schwarz, U. M. (2009). Tightness results for malleable task scheduling algorithms. In Parallel processing and applied mathematics."},{"key":"411_CR23","doi-asserted-by":"crossref","unstructured":"Turek, J., Wolf, J. L., & Yu, P. S. (1992) Approximate algorithms for scheduling parallelizable tasks. In 4th ACM symposium on parallel algorithms and architectures (SPAA).","DOI":"10.1145\/140901.141909"},{"key":"411_CR24","doi-asserted-by":"crossref","unstructured":"Vasi\u0107, N., Barisits, M., Salzgeber, V., Kosti\u0107, D. (2009). Making cluster applications energy-aware. In 1st workshop on automated control for datacenters and clouds (ACDC).","DOI":"10.1145\/1555271.1555281"},{"key":"411_CR25","unstructured":"Winkler, P., Zhang, L. (2003). Wavelength assignment and generalized interval graph coloring. In 14th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 830\u2013831)."},{"key":"411_CR26","volume-title":"Power generation operation and control","author":"AJ Wood","year":"1996","unstructured":"Wood, A. J., & Wollenberg, B. (1996). Power generation operation and control (2nd ed.). New York: Wiley.","edition":"2"},{"key":"411_CR27","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Hu, X., Chen, D. Z. (2002). Task scheduling and voltage selection for energy minimization. In Design automation conference (DAC) (pp. 183\u2013188).","DOI":"10.1145\/513918.513966"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0411-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0411-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0411-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:51Z","timestamp":1559468391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0411-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,19]]},"references-count":27,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["411"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0411-z","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,19]]}}}