{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:20:57Z","timestamp":1759335657671},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T00:00:00Z","timestamp":1325635200000},"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":[[2012,4]]},"DOI":"10.1007\/s10951-011-0263-8","type":"journal-article","created":{"date-parts":[[2012,1,3]],"date-time":"2012-01-03T17:34:45Z","timestamp":1325612085000},"page":"141-155","source":"Crossref","is-referenced-by-count":5,"title":["Windows scheduling of arbitrary-length jobs on multiple machines"],"prefix":"10.1007","volume":"15","author":[{"given":"Amotz","family":"Bar-Noy","sequence":"first","affiliation":[]},{"given":"Richard E.","family":"Ladner","sequence":"additional","affiliation":[]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[]},{"given":"Tammy","family":"VanDeGrift","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,4]]},"reference":[{"issue":"6","key":"263_CR1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/98.475988","volume":"2","author":"S. Acharya","year":"1995","unstructured":"Acharya, S., Franklin, M. J., & Zdonik, S. (1995). Dissemination-based data delivery using broadcast disks. IEEE Personal Communications, 2(6), 50\u201360.","journal-title":"IEEE Personal Communications"},{"issue":"4","key":"263_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0166-5316(85)90024-0","volume":"5","author":"H. Ammar","year":"1985","unstructured":"Ammar, H., & Wong, J. W. (1985). The design of teletext broadcast cycles. Performance Evaluation, 5(4), 235\u2013242.","journal-title":"Performance Evaluation"},{"issue":"1\u20133","key":"263_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0166-218X(97)00119-4","volume":"82","author":"S. Anily","year":"1998","unstructured":"Anily, S., Glass, C. A., & Hassin, R. (1998). The scheduling of maintenance service. Discrete Applied Mathematics (DAM), 82(1\u20133), 27\u201342.","journal-title":"Discrete Applied Mathematics (DAM)"},{"issue":"4","key":"263_CR4","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1137\/S009753970240447X","volume":"32","author":"A. Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., & Ladner, R. E. (2003). Windows scheduling problems for broadcast systems. SIAM Journal on Computing (SICOMP), 32(4), 1091\u20131113.","journal-title":"SIAM Journal on Computing (SICOMP)"},{"issue":"3","key":"263_CR5","doi-asserted-by":"crossref","first-page":"518","DOI":"10.1287\/moor.27.3.518.314","volume":"27","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Bhatia, R., Naor, J., & Schieber, B. (2002). Minimizing service and operation costs of periodic scheduling. Mathematics of Operations Research (MOR), 27(3), 518\u2013544.","journal-title":"Mathematics of Operations Research (MOR)"},{"issue":"4","key":"263_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s00446-002-0085-1","volume":"15","author":"A. Bar-Noy","year":"2002","unstructured":"Bar-Noy, A., Nisgav, A., & Patt-Shamir, B. (2002). Nearly optimal perfectly-periodic schedules. Distributed Computing, 15(4), 207\u2013220.","journal-title":"Distributed Computing"},{"key":"263_CR7","first-page":"791","volume-title":"Proceedings of the 14th ACM-SIAM symposium on discrete algorithms (SODA)","author":"A. Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Ladner, R. E., & Tamir, T. (2003). Scheduling techniques for media-on-demand. In Proceedings of the 14th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 791\u2013800)."},{"issue":"5","key":"263_CR8","first-page":"175","volume":"9","author":"A. Bar-Noy","year":"2003","unstructured":"Bar-Noy, A., Naor, J., & Schieber, B. (2003). Pushing dependent data in clients-providers-servers systems. Wireless Networks Journal (WINET), 9(5), 175\u2013186.","journal-title":"Wireless Networks Journal (WINET)"},{"key":"263_CR9","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Ladner, R. E., & Tamir, T. (2007). Windows scheduling as a restricted version of bin packing. ACM Transactions on Algorithms (TALG), 3(3), Article 28.","DOI":"10.1145\/1273340.1273344"},{"issue":"7","key":"263_CR10","doi-asserted-by":"crossref","first-page":"812","DOI":"10.1109\/12.709381","volume":"47","author":"S. K. Baruah","year":"1998","unstructured":"Baruah, S. K., & Lin, S.-S. (1998). Pfair scheduling of generalized pinwheel task systems. IEEE Transactions on Computers, 47(7), 812\u2013816.","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"263_CR11","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1007\/BF01940883","volume":"15","author":"S. K. Baruah","year":"1996","unstructured":"Baruah, S. K., Cohen, N. K., Plaxton, C. G., & Varvel, D. A. (1996). Proportionate progress: a notion of fairness in resource allocation. Algorithmica, 15(6), 600\u2013625.","journal-title":"Algorithmica"},{"key":"263_CR12","first-page":"68","volume-title":"IEEE real-time systems symposium","author":"S. K. Baruah","year":"1997","unstructured":"Baruah, S. K., Chen, D., & Mok, A. K. (1997). Jitter concerns in periodic task systems. In IEEE real-time systems symposium (pp.\u00a068\u201377)."},{"issue":"6","key":"263_CR13","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1007\/s11276-006-6531-4","volume":"12","author":"Z. Brakerski","year":"2006","unstructured":"Brakerski, Z., & Patt-Shamir, B. (2006). Jitter-approximation tradeoff for periodic scheduling. Wireless Networks, 12(6), 723\u2013731.","journal-title":"Wireless Networks"},{"issue":"2","key":"263_CR14","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0196-6774(03)00089-0","volume":"49","author":"Z. Brakerski","year":"2003","unstructured":"Brakerski, Z., Nisgav, A., & Patt-Shamir, B. (2003). Dispatching in perfectly-periodic schedules. Journal of Algorithms (JALG), 49(2), 219\u2013239.","journal-title":"Journal of Algorithms (JALG)"},{"key":"263_CR15","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.ejor.2003.09.036","volume":"165","author":"A. Campbell","year":"2005","unstructured":"Campbell, A., & Hardin, J. (2005). Vehicle minimization for periodic deliveries. European Journal of Operational Research, 165, 668\u2013684.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"263_CR16","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01187034","volume":"9","author":"M. Y. Chan","year":"1993","unstructured":"Chan, M. Y., & Chin, F. Y. L. (1993). Schedulers for larger classes of pinwheel instances. Algorithmica, 9(5), 425\u2013462.","journal-title":"Algorithmica"},{"key":"263_CR17","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/DCC.2006.66","volume-title":"Data compression conference","author":"N. Cherniavsky","year":"2006","unstructured":"Cherniavsky, N., & Ladner, R. E. (2006) Practical low delay broadcast of compressed variable bit rate movies. In Data compression conference (pp.\u00a0362\u2013371)."},{"key":"263_CR18","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman","year":"1996","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1996). Approximation algorithms for bin packing: a\u00a0survey. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp.\u00a046\u201393). Boston: PWS Publishing."},{"issue":"3","key":"263_CR19","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1002\/net.20105","volume":"47","author":"L. Engebretsen","year":"2006","unstructured":"Engebretsen, L., & Sudan, M. (2006). Harmonic broadcasting is bandwidth-optimal assuming constant bit rate. Networks, 47(3), 172\u2013177.","journal-title":"Networks"},{"key":"263_CR20","first-page":"1041","volume-title":"Proceedings of the 15th ACM-SIAM symposium on discrete algorithms (SODA)","author":"W.\u00a0S. Evans","year":"2004","unstructured":"Evans, W.\u00a0S., & Kirkpatrick, D.\u00a0G. (2004). Optimally scheduling video-on-demand to minimize delay when server and receiver bandwidth may differ. In Proceedings of the 15th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 1041\u20131049)."},{"key":"263_CR21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s00186-005-0443-4","volume":"62","author":"E. A. Feinberg","year":"2005","unstructured":"Feinberg, E. A., & Curry, M. T. (2005). Generalized pinwheel problem. Mathematical Methods of Operations Research, 62, 99\u2013122.","journal-title":"Mathematical Methods of Operations Research"},{"key":"263_CR22","first-page":"145","volume-title":"Proceedings of SPIE the international society of optical engineering","author":"E. A. Feinberg","year":"2002","unstructured":"Feinberg, E. A., Bender, M., Curry, M. T., Huang, D., Koutsoudis, T., & Bernstein, J. (2002). Sensor resource management for an airborne early warning radar. In Proceedings of SPIE the international society of optical engineering (pp. 145\u2013156)."},{"key":"263_CR23","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/BF02579456","volume":"1","author":"W. Fernandez de\u00a0la\u00a0Vega","year":"1981","unstructured":"Fernandez de\u00a0la\u00a0Vega, W., & Lueker, G.\u00a0S. (1981). Bin packing can be solved within 1+\u03b5 in linear time. Combinatorica, 1, 349\u2013355.","journal-title":"Combinatorica"},{"issue":"4","key":"263_CR24","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/s005300100049","volume":"8","author":"L. Gao","year":"2002","unstructured":"Gao, L., Kurose, J., & Towsley, D. (2002). Efficient schemes for broadcasting popular videos. Multimedia Systems, 8(4), 284\u2013294.","journal-title":"Multimedia Systems"},{"key":"263_CR25","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a\u00a0guide to the theory of NP-completeness. San Francisco: Freeman."},{"key":"263_CR26","first-page":"1276","volume":"3","author":"V. Gondhalekar","year":"1997","unstructured":"Gondhalekar, V., Jain, R., & Werth, J. (1997). Scheduling on airdisks: efficient access to personalized information services via periodic wireless data broadcast. IEEE International Conference on Communications (ICC), 3, 1276\u20131280.","journal-title":"IEEE International Conference on Communications (ICC)"},{"key":"263_CR27","first-page":"263","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 263\u2013269.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"263_CR28","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/j.ejor.2004.11.013","volume":"172","author":"A. Grigoriev","year":"2006","unstructured":"Grigoriev, A., Van\u00a0De Klundert, J., & Spieksma, F. (2006). Modeling and solving the periodic maintenance problem. European Journal of Operational Research, 172, 783\u2013797.","journal-title":"European Journal of Operational Research"},{"key":"263_CR29","volume-title":"Analysis of inventory systems","author":"G. Hadley","year":"1963","unstructured":"Hadley, G., & Whitin, T. M. (1963). Analysis of inventory systems. New York: Prentice Hall."},{"issue":"3","key":"263_CR30","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1287\/moor.16.3.534","volume":"16","author":"R. Hassin","year":"1991","unstructured":"Hassin, R., & Megiddo, N. (1991). Exact computation of optimal inventory policies over an unbounded horizon. Mathematics of Operations Research (MOR), 16(3), 534\u2013546.","journal-title":"Mathematics of Operations Research (MOR)"},{"key":"263_CR31","first-page":"693","volume-title":"Proceedings of the 22-nd Hawaii international conference on system sciences","author":"R. Holte","year":"1989","unstructured":"Holte, R., Mok, A., Rosier, L., Tulchinsky, I., & Varvel, D. (1989). The pinwheel: a\u00a0real-time scheduling problem. In Proceedings of the 22-nd Hawaii international conference on system sciences (pp. 693\u2013702)."},{"issue":"1","key":"263_CR32","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0304-3975(92)90365-M","volume":"100","author":"R. Holte","year":"1992","unstructured":"Holte, R., Rosier, L., Tulchinsky, I., & Varvel, D. (1992). Pinwheel scheduling with two distinct numbers. Theoretical Computer Science (TCS), 100(1), 105\u2013135.","journal-title":"Theoretical Computer Science (TCS)"},{"issue":"2\/3","key":"263_CR33","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/A:1009610701409","volume":"10","author":"K. A. Hua","year":"2000","unstructured":"Hua, K. A., & Sheu, S. (2000). An efficient periodic broadcast technique for digital video libraries. Multimedia Tools and Applications, 10(2\/3), 157\u2013177.","journal-title":"Multimedia Tools and Applications"},{"issue":"3","key":"263_CR34","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1109\/11.632927","volume":"43","author":"L. Juhn","year":"1997","unstructured":"Juhn, L., & Tseng, L. (1997). Harmonic broadcasting for video-on-demand service. IEEE Transactions on Broadcasting, 43(3), 268\u2013271.","journal-title":"IEEE Transactions on Broadcasting"},{"issue":"2","key":"263_CR35","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s00453-002-0990-5","volume":"35","author":"C. Kenyon","year":"2003","unstructured":"Kenyon, C., & Schabanel, N. (2003). The data broadcast problem with non-uniform transmission times. Algorithmica, 35(2), 146\u2013175.","journal-title":"Algorithmica"},{"key":"263_CR36","unstructured":"Kenyon, C., Schabanel, N., & Young, N. E. (2002). Polynomial-time approximation scheme for data broadcast. CoRR arXiv:cs\/0205012v1 [cs.DS]. Also, in Proceedings of the 32-nd ACM symposium on theory of computing (STOC) (pp.\u00a0659\u2013666) (2000)."},{"key":"263_CR37","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1287\/ijoc.9.4.351","volume":"9","author":"J. Korst","year":"1997","unstructured":"Korst, J., Aarts, E., & Lenstra, J. (1997). Scheduling periodic tasks with slack. INFORMS Journal on Computing, 9, 351\u2013362.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"263_CR38","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/321738.321743","volume":"20","author":"C. L. Liu","year":"1973","unstructured":"Liu, C. L., & Laylend, J. W. (1973). Scheduling algorithms for multiprogramming in a hard real-time environment. Journal of the ACM (JACM), 20(1), 46\u201361.","journal-title":"Journal of the ACM (JACM)"},{"key":"263_CR39","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1287\/mnsc.31.11.1416","volume":"31","author":"R. Roundy","year":"1985","unstructured":"Roundy, R. (1985). 98%-effective integer-ratio lot-sizing for one-warehouse multi-retailer systems. Management Science, 31, 1416\u20131460.","journal-title":"Management Science"},{"issue":"6","key":"263_CR40","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1016\/j.orl.2004.10.007","volume":"33","author":"F. C. R. Spieksma","year":"2005","unstructured":"Spieksma, F. C. R., & Woeginger, G. J. (2005). The no-wait flow-shop paradox. Operations Research Letters, 33(6), 603\u2013608.","journal-title":"Operations Research Letters"},{"key":"263_CR41","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/nav.3800180206","volume":"18","author":"W. Szwarc","year":"1971","unstructured":"Szwarc, W. The transportation paradox. Naval Research Logistics Quarterly 18, 185\u2013202 (1971).","journal-title":"Naval Research Logistics Quarterly"},{"key":"263_CR42","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0012-365X(80)90269-1","volume":"32","author":"R. Tijdeman","year":"1980","unstructured":"Tijdeman, R. (1980). The chairman assignment problem. Discrete Mathematics (DM), 32, 323\u2013330.","journal-title":"Discrete Mathematics (DM)"},{"issue":"3","key":"263_CR43","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s005300050023","volume":"4","author":"S. Viswanathan","year":"1996","unstructured":"Viswanathan, S., & Imielinski, T. (1996). Metropolitan area video-on-demand service using pyramid broadcasting. ACM Multimedia Systems Journal, 4(3), 197\u2013208.","journal-title":"ACM Multimedia Systems Journal"},{"key":"263_CR44","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0167-6377(83)90044-5","volume":"2","author":"W. Wei","year":"1983","unstructured":"Wei, W., & Liu, C. L. (1983). On a periodic maintenance problem. Operations Research Letters (ORL), 2, 90\u201393.","journal-title":"Operations Research Letters (ORL)"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0263-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0263-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0263-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,21]],"date-time":"2019-06-21T19:03:33Z","timestamp":1561143813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0263-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,4]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["263"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0263-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,4]]}}}