{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T06:08:03Z","timestamp":1762927683995},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1987,9,1]],"date-time":"1987-09-01T00:00:00Z","timestamp":557452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1987,9]]},"DOI":"10.1007\/bf00263292","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T12:15:17Z","timestamp":1096287317000},"page":"513-524","source":"Crossref","is-referenced-by-count":23,"title":["Minimizing mean flow-time with parallel processors and resource constraints"],"prefix":"10.1007","volume":"24","author":[{"given":"J.","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Kubiak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"R\u00f6ck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Szwarcfiter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,9,1]]},"reference":[{"key":"BF00263292_CR1","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/0020-0190(79)90143-1","volume":"8","author":"J. B\u0142a\u017cewicz","year":"1979","unstructured":"B\u0142a\u017cewicz, J.: Deadline scheduling of tasks with ready times and resource constraints. Inf. Proc. Lett. 8, 60\u201363 (1979)","journal-title":"Inf. Proc. Lett."},{"key":"BF00263292_CR2","first-page":"67","volume":"35","author":"J. B\u0142a\u017cewicz","year":"1979","unstructured":"B\u0142a\u017cewicz, J.: Scheduling tasks on parallel processors under resource constraints to minimize mean finishing time. Methods Oper. Res. 35, 67\u201372 (1979)","journal-title":"Methods Oper. Res."},{"key":"BF00263292_CR3","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0377-2217(86)90138-4","volume":"26","author":"J. B\u0142a\u017cewicz","year":"1986","unstructured":"B\u0142a\u017cewicz, J., Barcelo, J., Kubiak, W., R\u00f6ck, H.: Scheduling tasks on two processors with deadlines and additional resources. Eur. J. Oper. Res. 26, 364\u2013370 (1986)","journal-title":"Eur. J. Oper. Res."},{"key":"BF00263292_CR4","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1109\/TC.1986.1676781","volume":"C-35","author":"J. B\u0142a\u017cewicz","year":"1986","unstructured":"B\u0142a\u017cewicz, J., Drabowski, M., Weglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. C-35, 389\u2013393 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"BF00263292_CR5","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0167-6377(83)90042-1","volume":"2","author":"J. B\u0142a\u017cewicz","year":"1983","unstructured":"B\u0142a\u017cewicz, J., Ecker, K.: A linear time algorithm for restricted bin packing and scheduling problems. Oper. Res. Lett. 2, 80\u201383 (1983)","journal-title":"Oper. Res. Lett."},{"key":"BF00263292_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. B\u0142a\u017cewicz","year":"1983","unstructured":"B\u0142a\u017cewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constraints: classification and complexity. Discrete Appl. Math. 5, 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"key":"BF00263292_CR7","volume-title":"Computer and Job\/Shop Scheduling Theory","author":"J.L. Bruno","year":"1976","unstructured":"Bruno, J.L.: Scheduling algorithms for minimizing the mean weighted flow-time criterion. In: Computer and Job\/Shop Scheduling Theory, Coffman, E.G., Jr. (ed.). New York: Wiley 1976"},{"key":"BF00263292_CR8","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/361011.361064","volume":"17","author":"J. Bruno","year":"1974","unstructured":"Bruno, J., Coffman, E.G., Jr., Sethi, R.: Scheduling independent tasks to reduce mean finishing time. Commun. ACM 17, 382\u2013387 (1974)","journal-title":"Commun. ACM"},{"key":"BF00263292_CR9","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1137\/0204035","volume":"4","author":"M.R. Garey","year":"1975","unstructured":"Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4, 397\u2013411 (1975)","journal-title":"SIAM J. Comput."},{"key":"BF00263292_CR10","volume-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. San Francisco: Freeman 1979"},{"key":"BF00263292_CR11","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R.L. Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Optimization and approximation in deterministic sequencing and scheduling theory: a survey. Ann. Discrete Math. 5, 287\u2013326 (1979)","journal-title":"Ann. Discrete Math."},{"key":"BF00263292_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0196-6774(83)90045-7","volume":"4","author":"D.S. Johnson","year":"1983","unstructured":"Johnson, D.S.: The NP-completeness column; an ongoing guide. J. Algorithms 4, 189\u2013203 (1983)","journal-title":"J. Algorithms"},{"key":"BF00263292_CR13","volume-title":"Combinatorial Optimization: Annotated Bibliographies","author":"J.K. Lenstra","year":"1985","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling theory since 1981: an annotated bibliography. In: M.O.H. Eighertaigh, J.K. Lenstra, A.H.G. Rinnooy Kan (eds.), Combinatorial Optimization: Annotated Bibliographies. Chichester: Wiley 1985"},{"key":"BF00263292_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"12","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Sci. 12, 1\u201312 (1959)","journal-title":"Management Sci."},{"key":"BF00263292_CR15","first-page":"225","volume":"16","author":"R.H. M\u00f6hring","year":"1982","unstructured":"M\u00f6hring, R.H.: Scheduling problems with a singular solution. Ann. Discrete Math. 16, 225\u2013339 (1982)","journal-title":"Ann. Discrete Math."},{"key":"BF00263292_CR16","volume-title":"Kapazit\u00e4tsoptimierung in Netzpl\u00e4nen. Mathematical Systems in Economics. Vol. 40","author":"F.J. Radermacher","year":"1978","unstructured":"Radermacher, F.J.: Kapazit\u00e4tsoptimierung in Netzpl\u00e4nen. Mathematical Systems in Economics. Vol. 40. Meisenheim: Verlag Anton Hain 1978"},{"key":"BF00263292_CR17","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02022042","volume":"4","author":"F.J. Radermacher","year":"1985\/86","unstructured":"Radermacher, F.J.: Scheduling of project networks. Ann. Oper. Res. 4, 227\u2013252 (1985\/86)","journal-title":"Ann. Oper. Res."},{"key":"BF00263292_CR18","first-page":"1","volume":"28","author":"H. R\u00f6ck","year":"1984","unstructured":"R\u00f6ck, H.: Some new results in flow shop scheduling. Zeitschr. Oper. Res. 28, 1\u201316 (1984)","journal-title":"Zeitschr. Oper. Res."},{"key":"BF00263292_CR19","first-page":"155","volume":"15","author":"R. S\u0142owinski","year":"1981","unstructured":"S\u0142owinski, R.: L'ordonnancement des t\u00e2ches pre\u00e9mptives sur les processeurs ind\u00e9pendants en pr\u00e9sense de ressources suppl\u00e9mentaires. RAIRO Inf. 15, 155\u2013166 (1981)","journal-title":"RAIRO Inf."},{"key":"BF00263292_CR20","volume-title":"Computer and Job\/Shop Scheduling Theory","author":"J.D. Ullman","year":"1976","unstructured":"Ullman, J.D.: Complexity of Sequencing Problems. In: Computer and Job\/Shop Scheduling Theory. Coffman, E.G., Jr. (ed.). New York: Wiley 1976"},{"key":"BF00263292_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1137\/0605003","volume":"5","author":"D. Werra De","year":"1984","unstructured":"De Werra, D.: Preemptive scheduling, linear programming and network flows. SIAM J. Algebraic Discrete Methods 5, 11\u201320 (1984)","journal-title":"SIAM J. Algebraic Discrete Methods"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263292.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00263292\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263292","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00263292.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T06:21:12Z","timestamp":1565936472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00263292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,9]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1987,9]]}},"alternative-id":["BF00263292"],"URL":"https:\/\/doi.org\/10.1007\/bf00263292","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,9]]}}}