{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:07:43Z","timestamp":1770509263981,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540236597","type":"print"},{"value":"9783540301769","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30176-9_9","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T20:06:58Z","timestamp":1285272418000},"page":"68-75","source":"Crossref","is-referenced-by-count":16,"title":["Flow Shop Scheduling with Late Work Criterion \u2013 Choosing the Best Solution Strategy"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Blazewicz","sequence":"first","affiliation":[]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[]},{"given":"Malgorzata","family":"Sterna","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","first-page":"415","volume":"3\/6","author":"J. Blazewicz","year":"1984","unstructured":"Blazewicz, J.: Scheduling Preemptible Tasks on Parallel Processors with Information Loss. Recherche Technique et Science Informatiques\u00a03\/6, 415\u2013420 (1984)","journal-title":"Recherche Technique et Science Informatiques"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","volume":"24","author":"J. Blazewicz","year":"1987","unstructured":"Blazewicz, J., Finke, G.: Minimizing Mean Weighted Execution Time Loss on Identical and Uniform Processors. Information Processing Letters\u00a024, 259\u2013263 (1987)","journal-title":"Information Processing Letters"},{"key":"9_CR3","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/978-3-642-58300-1_54","volume-title":"Operations Research Proceedings 1999","author":"J. Blazewicz","year":"2000","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Total Late Work Criteria for Shop Scheduling Problems. In: Inderfurth, K., Schwoediauer, G., Domschke, W., Juhnke, F., Kleinschmidt, P., Waescher, G. (eds.) Operations Research Proceedings 1999, pp. 354\u2013359. Springer, Heidelberg (2000)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(03)00339-1","volume":"134","author":"J. Blazewicz","year":"2004","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Open Shop Scheduling Problems with Late Work Criteria. Discrete Applied Mathematics\u00a0134, 1\u201324 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: The Two-Machine Flow-Shop Problem with Weighted Late Work Criterion and Common Due Date. European Journal of Operational Research (2004) (to appear)","DOI":"10.1016\/j.ejor.2004.04.011"},{"key":"9_CR6","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Revenue Management in a Job-Shop: a Dynamic Programming Approach. Preprint Nr. 40\/03, Otto-von-Guericke-University Magdeburg (2003)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S.M. Johnson","year":"1954","unstructured":"Johnson, S.M.: Optimal Two- and Three-Stage Production Schedules. Naval Research Logistics Quarterly\u00a01, 61\u201368 (1954)","journal-title":"Naval Research Logistics Quarterly"},{"key":"9_CR8","unstructured":"Kowalski, K.: Scheduling Algorithms for the Shop Scheduling Problems with the Late Work Criteria, Master Thesis, Poznan University of Technology (2003) (in Polish)"},{"key":"9_CR9","first-page":"586","volume":"40\/3","author":"C.N. Potts","year":"1991","unstructured":"Potts, C.N., van Wassenhove, L.N.: Single Machine Scheduling to Minimize Total Late Work. Operations Research\u00a040\/3, 586\u2013595 (1991)","journal-title":"Operations Research"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0167-6377(92)90001-J","volume":"11","author":"C.N. Potts","year":"1991","unstructured":"Potts, C.N., van Wassenhove, L.N.: Approximation Algorithms for Scheduling a Single Machine to Minimize Total Late Work. Operations Research Letters\u00a011, 261\u2013266 (1991)","journal-title":"Operations Research Letters"},{"key":"9_CR11","unstructured":"Sterna, M.: Problems and Algorithms in Non-Classical Shop Scheduling. Scientific Publishers of the Polish Academy of Sciences, Poznan (2000)"}],"container-title":["Lecture Notes in Computer Science","Applied Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30176-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:53:31Z","timestamp":1558306411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30176-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540236597","9783540301769"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30176-9_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}