{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:56Z","timestamp":1725575216769},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540258636"},{"type":"electronic","value":"9783540323099"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11424925_21","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T16:14:27Z","timestamp":1295108067000},"page":"182-191","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Algorithm for Parallel Machine Mean Flow Time Scheduling Problem with Release Dates"],"prefix":"10.1007","author":[{"given":"Peter","family":"Brucker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana A.","family":"Kravchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","first-page":"78","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"P. Baptiste","year":"2004","unstructured":"Baptiste, P., Brucker, P.: Scheduling Equal Processing Time Jobs: A Survey. In: Leung, Y.T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, pp. 78\u201396. CRC Press LLC, Boca Raton (2004)"},{"key":"21_CR2","first-page":"59","volume":"37","author":"P. Brucker","year":"1993","unstructured":"Brucker, P., Jurisch, B., Jurisch, M.: Open shop problems with unit time operations. Z. Oper. Res.\u00a037, 59\u201373 (1993)","journal-title":"Z. Oper. Res."},{"key":"21_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, Berlin (2001)","edition":"3"},{"key":"21_CR4","volume-title":"Linear programming","author":"V. Chvatal","year":"1983","unstructured":"Chvatal, V.: Linear programming. Freeman, New York (1983)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","volume":"75","author":"J. Du","year":"1990","unstructured":"Du, J., Leung, J.Y.-T., Young, G.H.: Minimizing mean flow time with release time constraint. Theoretical Computer Science\u00a075, 347\u2013355 (1990)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","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. W.H. Freeman and Company, San Francisco (1979)"},{"key":"21_CR7","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: A survey. Ann Discrete Math\u00a05, 287\u2013326 (1979)","journal-title":"Ann Discrete Math"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1287\/opre.38.3.487","volume":"38","author":"L.A. Herrbach","year":"1990","unstructured":"Herrbach, L.A., Leung, J.Y.-T.: Preemptive scheduling of equal length jobs on two machines to minimize mean flow time. Operations Research\u00a038, 487\u2013494 (1990)","journal-title":"Operations Research"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0166-218X(99)00202-4","volume":"100","author":"S.A. Kravchenko","year":"2000","unstructured":"Kravchenko, S.A.: On the complexity of minimizing the number of late jobs in unit time open shop. Discrete Applied Mathematics\u00a0100, 127\u2013132 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0020-0190(90)90229-Q","volume":"34","author":"J.Y.-T. Leung","year":"1990","unstructured":"Leung, J.Y.-T., Young, G.H.: Preemptive scheduling to minimize mean weighted flow time. Information Processing Letters\u00a034, 47\u201350 (1990)","journal-title":"Information Processing Letters"},{"key":"21_CR11","volume-title":"Combinatorial Optimization: Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York (1976)"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Science\u00a06, 1\u201312 (1959\/1960)","journal-title":"Management Science"},{"key":"21_CR13","first-page":"193","volume":"18","author":"E. Mokotoff","year":"2001","unstructured":"Mokotoff, E.: Parallel machine scheduling problem: survey. Asia-Pacific Journal of Operational Research\u00a018, 193\u2013242 (2001)","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"21_CR14","volume-title":"Combinatorial Optimization","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization. Springer, Berlin (2003)"},{"key":"21_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0167-6377(97)00015-1","volume":"20","author":"T. Tautenhahn","year":"1997","unstructured":"Tautenhahn, T., Woeginger, G.J.: Minimizing the total completion time in a unittime open shop with release times. Operations Research Letters\u00a020, 207\u2013212 (1997)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11424925_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:06:03Z","timestamp":1619507163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11424925_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540258636","9783540323099"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11424925_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}