{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T15:49:27Z","timestamp":1648741767578},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,10]],"date-time":"2011-11-10T00:00:00Z","timestamp":1320883200000},"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,8]]},"DOI":"10.1007\/s10951-011-0259-4","type":"journal-article","created":{"date-parts":[[2011,11,9]],"date-time":"2011-11-09T18:29:37Z","timestamp":1320863377000},"page":"473-486","source":"Crossref","is-referenced-by-count":0,"title":["Routing equal-size messages on a slotted ring"],"prefix":"10.1007","volume":"15","author":[{"given":"Dariusz","family":"Dereniowski","sequence":"first","affiliation":[]},{"given":"Wies\u0142aw","family":"Kubiak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,11,10]]},"reference":[{"key":"259_CR1","first-page":"238","volume-title":"ISCIS","author":"D. Barth","year":"2004","unstructured":"Barth,\u00a0D., Cohen,\u00a0J., Gastal,\u00a0L., Mautor,\u00a0T., & Rousseau,\u00a0S. (2004). Fixed size and variable size packet models in an optical ring network: complexity and simulations. In ISCIS (pp. 238\u2013246)."},{"key":"259_CR2","first-page":"167","volume-title":"ONDM","author":"A. Bianco","year":"2002","unstructured":"Bianco,\u00a0A., Bonsignori,\u00a0M., Leonardi,\u00a0E., & Neri,\u00a0F. (2002). Variable-size packets in slotted wdm ring networks. In ONDM (pp. 167\u2013182)."},{"key":"259_CR3","first-page":"20","volume-title":"IEEE international conference on communications, ICC","author":"A. Bianco","year":"2004","unstructured":"Bianco,\u00a0A., Finochietto, J.\u00a0M., Galante,\u00a0G., Neri,\u00a0F., & Sarra,\u00a0V. (2004). Scheduling variable-size packets in the David metropolitan area network. In IEEE international conference on communications, ICC (pp. 20\u201324)."},{"issue":"1\u20133","key":"259_CR4","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0012-365X(92)90646-W","volume":"100","author":"M. Bir\u00f3","year":"1992","unstructured":"Bir\u00f3,\u00a0M., Hujter,\u00a0M., & Tuza, Zs. (1992). Precoloring extension. I: Interval graphs. Discrete Mathematics, 100(1\u20133), 267\u2013279.","journal-title":"Discrete Mathematics"},{"key":"259_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03217-6","volume-title":"Scheduling computer and manufacturing processes","author":"J. B\u0142a\u017cewicz","year":"1996","unstructured":"B\u0142a\u017cewicz,\u00a0J., Ecker,\u00a0K., Pesch,\u00a0E., Schmidt,\u00a0G., & W\u0119glarz,\u00a0J. (1996). Scheduling computer and manufacturing processes. New York: Springer."},{"key":"259_CR6","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1016\/S0167-8191(00)00035-1","volume":"26","author":"J. B\u0142a\u017cewicz","year":"2000","unstructured":"B\u0142a\u017cewicz,\u00a0J., Drozdowski,\u00a0M., Formanowicz,\u00a0P., Kubiak,\u00a0W., & Schmidt,\u00a0G. (2000). Scheduling preemptable tasks on parallel processors with limited availability. Parallel Computing, 26, 1195\u20131211.","journal-title":"Parallel Computing"},{"key":"259_CR7","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898719796","volume-title":"Graph classes: a\u00a0survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt,\u00a0A., Le, V.\u00a0B., & Spinrad, J.\u00a0P. (1999). Graph classes: a\u00a0survey. Philadelphia: Society for Industrial and Applied Mathematics."},{"key":"259_CR8","first-page":"183","volume-title":"ONDM","author":"A. Carena","year":"2002","unstructured":"Carena,\u00a0A., Ferrero,\u00a0V., Gaudino,\u00a0R., De Feo,\u00a0V., Neri,\u00a0F., & Poggiolini,\u00a0P. (2002). Ringo: a\u00a0demonstrator of wdm optical packet network on a ring topology. In ONDM (pp. 183\u2013197)."},{"issue":"2","key":"259_CR9","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.comcom.2006.08.011","volume":"30","author":"M. Chaitou","year":"2007","unstructured":"Chaitou,\u00a0M., H\u00e9buterne,\u00a0G., & Castel,\u00a0H. (2007). Performance of multicast in wdm slotted ring networks. Computer Communications, 30(2), 219\u2013232.","journal-title":"Computer Communications"},{"key":"259_CR10","volume-title":"Invited presentation at APOC","author":"D. Chiaroni","year":"2008","unstructured":"Chiaroni,\u00a0D. (2008). The French RNRT ECOFRAME project: packet technology perspectives in metro networks. In Invited presentation at APOC."},{"key":"259_CR11","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s10951-009-0139-3","volume":"13","author":"D. Dereniowski","year":"2010","unstructured":"Dereniowski,\u00a0D., & Kubiak,\u00a0W. (2010). Makespan minimization of multislot just-in-time scheduling on single and parallel machines. Journal of Scheduling, 13, 479\u2013492.","journal-title":"Journal of Scheduling"},{"key":"259_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0022-0000(85)90014-5","volume":"30","author":"H. Gabow","year":"1985","unstructured":"Gabow,\u00a0H., & Tarjan,\u00a0R. (1985). A\u00a0linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences, 30, 209\u2013221.","journal-title":"Journal of Computer and System Sciences"},{"key":"259_CR13","isbn-type":"print","volume-title":"Computers and intractability: a\u00a0guide to the theory of NP-completeness","author":"M.\u00a0R. Garey","year":"1979","unstructured":"Garey, M.\u00a0R., & Johnson, D.\u00a0S. (1979). Computers and intractability: a\u00a0guide to the theory of NP-completeness. New York: W.H. Freeman. ISBN 0716710447.","ISBN":"http:\/\/id.crossref.org\/isbn\/0716710447"},{"issue":"2","key":"259_CR14","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0601025","volume":"1","author":"M.\u00a0R. Garey","year":"1980","unstructured":"Garey, M.\u00a0R., Johnson, D.\u00a0S., Miller, G.\u00a0L., & Papadimitriou, C.\u00a0H. (1980). The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods, 1(2), 216\u2013227.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"5","key":"259_CR15","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P.\u00a0C. Gilmore","year":"1964","unstructured":"Gilmore, P.\u00a0C., & Gomory, R.\u00a0E. (1964). Sequencing a one state-variable machine: a\u00a0solvable case of the traveling salesman problem. Operations Research, 12(5), 655\u2013679.","journal-title":"Operations Research"},{"key":"259_CR16","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/COMST.2004.5342236","volume":"6","author":"M. Herzog","year":"2004","unstructured":"Herzog,\u00a0M., Maier,\u00a0M., & Reisslein,\u00a0M. (2004). Metropolitan area packet-switched wdm networks: a\u00a0survey on ring systems. IEEE Communications Surveys and Tutorials, 6, 2\u201320.","journal-title":"IEEE Communications Surveys and Tutorials"},{"key":"259_CR17","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04616-6","volume-title":"Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics","author":"J. Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d,\u00a0J. (2001). Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics. New York: Springer. ISBN 3-540-66860-8.","ISBN":"http:\/\/id.crossref.org\/isbn\/3540668608"},{"key":"259_CR18","volume-title":"Just-in-time scheduling","author":"J. J\u00f3zefowska","year":"2007","unstructured":"J\u00f3zefowska,\u00a0J. (2007). Just-in-time scheduling. New York: Springer."},{"issue":"9","key":"259_CR19","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/0169-7552(94)00055-X","volume":"27","author":"C.-S. Kang","year":"1995","unstructured":"Kang, C.-S., Park, B.-S., Shin, J.-D., & Jeong, J.-M. (1995). A\u00a0broadband ring network: multichannel optical slotted ring. Computer Networks and ISDN Systems, 27(9), 1387\u20131398.","journal-title":"Computer Networks and ISDN Systems"},{"issue":"5","key":"259_CR20","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1109\/TC.1987.1676940","volume":"36","author":"P.\u00a0J.\u00a0B. King","year":"1987","unstructured":"King, P.\u00a0J.\u00a0B., & Mitrani,\u00a0I. (1987). Modeling a slotted ring local area network. IEEE Transactions on Computers, 36(5), 554\u2013561.","journal-title":"IEEE Transactions on Computers"},{"key":"259_CR21","volume-title":"Proportional optimization and fairness","author":"W. Kubiak","year":"2009","unstructured":"Kubiak,\u00a0W. (2009). Proportional optimization and fairness. New York: Springer."},{"issue":"3","key":"259_CR22","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0305-0548(96)00028-7","volume":"24","author":"C.\u00a0Y. Lee","year":"1997","unstructured":"Lee, C.\u00a0Y., & Chang, S.\u00a0G. (1997). Balancing loads on sonet rings with integer demand splitting. Computers & Operations Research, 24(3), 221\u2013229.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"259_CR23","first-page":"269","volume":"4","author":"V.\u00a0O.\u00a0K. Li","year":"2007","unstructured":"Li, V.\u00a0O.\u00a0K., Chang, J.-F., Lee, K.-C., & Yang, T.-S. (2007). A\u00a0survey of research and standards in high-speed networks. International Journal of Digital & Analog Communication Systems, 4(4), 269\u2013309.","journal-title":"International Journal of Digital & Analog Communication Systems"},{"key":"259_CR24","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF00264533","volume":"15","author":"W. Lipski Jr.","year":"1981","unstructured":"Lipski,\u00a0W. Jr., & Preparata, F.\u00a0P. (1981). Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems. Acta Informatica, 15, 329\u2013346.","journal-title":"Acta Informatica"},{"key":"259_CR25","first-page":"146","volume-title":"MASCOTS\u201997: proceedings of the 5th international workshop on modeling, analysis, and simulation of computer and telecommunications systems","author":"M.\u00a0A. Marsan","year":"1997","unstructured":"Marsan, M.\u00a0A., Fumagalli,\u00a0A., Leonardi,\u00a0E., & Neri,\u00a0F. (1997). Modelling slotted multi-channel ring all-optical networks. In MASCOTS\u201997: proceedings of the 5th international workshop on modeling, analysis, and simulation of computer and telecommunications systems (p.\u00a0146)."},{"issue":"2","key":"259_CR26","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.orl.2003.08.001","volume":"32","author":"Y.-S. Myung","year":"2004","unstructured":"Myung, Y.-S., & Kim, H.-G. (2004). On the ring loading problem with demand splitting. Operations Research Letters, 32(2), 167\u2013173.","journal-title":"Operations Research Letters"},{"key":"259_CR27","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1016\/j.ejc.2007.03.006","volume":"29","author":"B. Ries","year":"2008","unstructured":"Ries,\u00a0B., & de Werra,\u00a0D. (2008). On two coloring problems in mixed graphs. European Journal of Combinatorics, 29, 712\u2013725.","journal-title":"European Journal of Combinatorics"},{"issue":"1","key":"259_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A. Schrijver","year":"1998","unstructured":"Schrijver,\u00a0A., Seymour, P.\u00a0D., & Winkler,\u00a0P. (1998). On the ring loading problem. SIAM Journal on Discrete Mathematics, 11(1), 1\u201314.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"259_CR29","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/0233193021000004994","volume":"51","author":"Y.\u00a0N. Sotskov","year":"2002","unstructured":"Sotskov, Y.\u00a0N., Tanaev, V.\u00a0S., & Werner,\u00a0F. (2002). Scheduling problems and mixed graph colorings. Optimization, 51, 597\u2013624.","journal-title":"Optimization"},{"issue":"12","key":"259_CR30","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0898-1221(96)00079-X","volume":"31","author":"G. Steiner","year":"1996","unstructured":"Steiner,\u00a0G., & Yeomans, J.\u00a0S. (1996). A\u00a0linear time algorithm for maximum matchings in convex, bipartite graphs. Computers & Mathematics with Applications, 31(12), 91\u201396.","journal-title":"Computers & Mathematics with Applications"},{"key":"259_CR31","volume-title":"ISME\u201907: international symposium on management engineering","author":"S.-Ch. Sung","year":"2007","unstructured":"Sung, S.-Ch., \u010cepek,\u00a0O., & Hiraishi,\u00a0K. (2007a). Algorithm for multislot just-in-time scheduling. In ISME\u201907: international symposium on management engineering."},{"key":"259_CR32","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/ICICIC.2007.123","volume-title":"ICICIC\u201907: proceedings of the second international conference on innovative computing, information and control","author":"S.-Ch. Sung","year":"2007","unstructured":"Sung, S.-Ch., \u010cepek,\u00a0O., & Hiraishi,\u00a0K. (2007b). Algorithm for multislot just-in-time scheduling on identical parallel machines. In ICICIC\u201907: proceedings of the second international conference on innovative computing, information and control (p.\u00a0120)."},{"key":"259_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1190-4","volume-title":"Scheduling theory. Single stage systems","author":"V.\u00a0S. Tanaev","year":"1994","unstructured":"Tanaev, V.\u00a0S., Gordon, V.\u00a0S., & Shafransky, Y.\u00a0M. (1994). Scheduling theory. Single stage systems. Dordrecht: Kluwer."},{"key":"259_CR34","volume-title":"Approximation algorithms","author":"V.\u00a0V. Vazirani","year":"2001","unstructured":"Vazirani, V.\u00a0V. (2001). Approximation algorithms. Berlin: Springer."},{"key":"259_CR35","first-page":"431","volume":"10","author":"O. \u010cepek","year":"2004","unstructured":"\u010cepek,\u00a0O., & Sung, S.-Ch. (2004). Just-in-time scheduling with periodic time slots. Scientiae Mathematicae Japonicae Online, 10, 431\u2013437.","journal-title":"Scientiae Mathematicae Japonicae Online"},{"issue":"1","key":"259_CR36","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/j.jalgor.2004.03.003","volume":"54","author":"B.-F. Wang","year":"2005","unstructured":"Wang, B.-F. (2005). Linear time algorithms for the ring loading problem with demand splitting. Journal of Algorithms, 54(1), 45\u201357.","journal-title":"Journal of Algorithms"},{"issue":"8","key":"259_CR37","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1109\/JSAC.2004.830448","volume":"22","author":"H.-S. Yang","year":"2004","unstructured":"Yang, H.-S., Herzog,\u00a0M., Maier,\u00a0M., & Reisslein,\u00a0M. (2004). Metro wdm networks: performance comparison of slotted ring and awg star networks. IEEE Journal on Selected Areas in Communications, 22(8), 1460\u20131473.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"259_CR38","first-page":"TuK2-1","volume-title":"Optical fiber communication conference and exhibit, OFC\u201901","author":"S. Yao","year":"2001","unstructured":"Yao,\u00a0S., Yoo, S.\u00a0J.\u00a0B., & Mukherjee,\u00a0B. (2001). A\u00a0comparison study between slotted and unslotted all-optical packet-switched network with priority-based routing. In Optical fiber communication conference and exhibit, OFC\u201901 (Vol.\u00a02, pp. TuK2-1\u2013TuK2-3)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0259-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0259-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0259-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,15]],"date-time":"2021-12-15T22:32:19Z","timestamp":1639607539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0259-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,10]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["259"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0259-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,10]]}}}