{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:00:06Z","timestamp":1776790806410,"version":"3.51.2"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,1,25]],"date-time":"2007-01-25T00:00:00Z","timestamp":1169683200000},"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":[[2007,2,14]]},"DOI":"10.1007\/s10951-006-0006-4","type":"journal-article","created":{"date-parts":[[2007,1,24]],"date-time":"2007-01-24T22:03:26Z","timestamp":1169676206000},"page":"139-146","source":"Crossref","is-referenced-by-count":21,"title":["The complexity of mean flow time scheduling problems with release times"],"prefix":"10.1007","volume":"10","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Brucker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marek","family":"Chrobak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"D\u00fcrr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Svetlana A.","family":"Kravchenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francis","family":"Sourd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,1,25]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","volume":"2","author":"Ph. Baptiste","year":"1999","unstructured":"Baptiste, Ph., \u201cPolynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal,\u201d Journal of Scheduling, 2, 245\u2013252 (1999).","journal-title":"Journal of Scheduling"},{"key":"6_CR2","unstructured":"Baptiste Ph., J. Carlier, A. Kononov, M. Queyranne, S. Sevastyanov, and M. Sviridenko, \u201cStructural properties of preemptive schedules,\u201d Journal of Scheduling (to appear)."},{"key":"6_CR3","first-page":"59","volume":"37","author":"P. Brucker","year":"1993","unstructured":"Brucker, P., B. Jurisch, and M. Jurisch, \u201cOpen-shop problems with unit time operations,\u201d Zeitschrift f\u00fcr Operations Research, 37, 59\u201373 (1993).","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"6_CR4","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0304-3975(90)90100-V","volume":"75","author":"J. Du","year":"1990","unstructured":"Du, J., J. Y.-T. Leung, and G. H. Young, \u201cMinimizing mean flow time with release time constraint,\u201d Theoretical Computer Science, 75, 347\u2013355 (1990).","journal-title":"Theoretical Computer Science"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/opre.38.3.487","volume":"38","author":"L. A. Herrbach","year":"1990","unstructured":"Herrbach, L. A. and J. Y.-T. Leung, \u201cPreemptive scheduling of equal length jobs on two machines to minimize mean flow time,\u201d Operations Research, 38, 487\u2013494 (1990).","journal-title":"Operations Research"},{"key":"6_CR6","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(99)00202-4","volume":"100","author":"S. A. Kravchenko","year":"2000","unstructured":"Kravchenko, S. A., \u201cOn the complexity of minimizing the number of late jobs in unit time open shop,\u201d Discrete Applied Mathematics, 100, 127\u2013132 (2000).","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR7","doi-asserted-by":"crossref","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. and G. H. Young, \u201cPreemptive scheduling to minimize mean weighted flow time,\u201d Information Processing Letters, 34, 47\u201350 (1990).","journal-title":"Information Processing Letters"},{"key":"6_CR8","unstructured":"Schrijver, A. Combinatorial Optimization, Springer Verlag, 2003."},{"key":"6_CR9","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1287\/opre.34.2.250","volume":"34","author":"\u00c9. Tardos","year":"1986","unstructured":"Tardos, \u00c9., \u201cA strongly polynomial algorithm to solve combinatorial linear programs,\u201d Operations Research, 34, 250\u2013256 (1986).","journal-title":"Operations Research"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0167-6377(97)00015-1","volume":"20","author":"T. Tautenhahn","year":"1997","unstructured":"Tautenhahn, T. and G. J. Woeginger, \u201cMinimizing the total completion time in a unit-time open shop with release times,\u201d Operations Research Letters, 20, 207\u2013212 (1997).","journal-title":"Operations Research Letters"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-0006-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-006-0006-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-006-0006-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:38Z","timestamp":1559453978000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-006-0006-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,25]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,2,14]]}},"alternative-id":["6"],"URL":"https:\/\/doi.org\/10.1007\/s10951-006-0006-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,25]]}}}