{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:47:52Z","timestamp":1770500872325,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540287612","type":"print"},{"value":"9783540318187","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11551263_19","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:37:27Z","timestamp":1127831847000},"page":"222-234","source":"Crossref","is-referenced-by-count":5,"title":["Metaheuristics for Late Work Minimization in Two-Machine Flow Shop with Common Due Date"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Blazewicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malgorzata","family":"Sterna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.S. Barr","year":"1995","unstructured":"Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart Jr., W.R.: Designing and Reporting on Computational Experiments with Heuristic Methods. Journal of Heuristics\u00a01, 9\u201332 (1995)","journal-title":"Journal of Heuristics"},{"key":"19_CR2","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":"19_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04363-9","volume-title":"Scheduling Computer and Manufacturing Processes","author":"J. Blazewicz","year":"2001","unstructured":"Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes, 2nd edn. Springer, Berlin (2001)","edition":"2"},{"key":"19_CR4","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":"19_CR5","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., Werner, F.: Revenue Management in a Job-shop: a\u00a0Dynamic Programming Approach. Preprint Nr. 40\/03. Otto-von-Guericke-University, Magdeburg (2003)"},{"key":"19_CR6","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":"19_CR7","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2004.04.011","volume":"165\/2","author":"J. Blazewicz","year":"2005","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\u00a0165\/2, 408\u2013415 (2005)","journal-title":"European Journal of Operational Research"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-30176-9_9","volume-title":"Applied Computing","author":"J. B\u0142a\u017cewicz","year":"2004","unstructured":"B\u0142a\u017cewicz, J., Pesch, E., Sterna, M., Werner, F.: Flow Shop Scheduling with Late Work Criterion \u2013 Choosing the Best Solution Strategy. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds.) AACC 2004. LNCS, vol.\u00a03285, pp. 68\u201375. Springer, Heidelberg (2004)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35\/3","author":"C. Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison. ACM Computing Surveys\u00a035\/3, 268\u2013308 (2003)","journal-title":"ACM Computing Surveys"},{"key":"19_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03612-9","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"1998","unstructured":"Brucker, P.: Scheduling Algorithms, 2nd edn. Springer, Berlin (1998)","edition":"2"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BFb0027029","volume-title":"Artificial Neural Networks","author":"Y. Crama","year":"1995","unstructured":"Crama, Y., Kolen, A., Pesch, E.: Local Search in Combinatorial Optimization. In: Braspenning, P.J., Weijters, A.J.M.M.T., Thuijsman, F. (eds.) Neural Network School 1999. LNCS, vol.\u00a0931, pp. 157\u2013174. Springer, Heidelberg (1995)"},{"key":"19_CR12","unstructured":"Dorndorf, U., Pesch, E.: Variable Depth Search and Embedded Schedule Neighbourhoods for Job Shop Scheduling. In: Proceedings of the 4th International Workshop on Project Management and Scheduling, pp. 232\u2013235 (1994)"},{"key":"19_CR13","volume-title":"Computers and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. W.H. Freeman and Co., San Francisco (1979)"},{"key":"19_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Boston (1997)"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable Neighbour Search. Principles and Applications. European Journal of Operational Research\u00a0130, 449\u2013467 (2001)","journal-title":"Principles and Applications. European Journal of Operational Research"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01721162","volume":"11","author":"R. Haupt","year":"1989","unstructured":"Haupt, R.: A Survey of Priority Rule\u2013Based Scheduling. OR Spektrum\u00a011, 3\u201316 (1989)","journal-title":"OR Spektrum"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"J.N. Hooker","year":"1995","unstructured":"Hooker, J.N.: Testing Heuristics: We Have It All Wrong. Journal of Heuristics\u00a01, 33\u201342 (1995)","journal-title":"Journal of Heuristics"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220\/4598","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by Simulated Annealing. Science\u00a0220\/4598, 671\u2013680 (1983)","journal-title":"Science"},{"key":"19_CR19","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":"19_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"J.Y.T. Leung","year":"2004","unstructured":"Leung, J.Y.T.: Minimizing Total Weighted Error for Imprecise Computation Tasks and Related Problems. In: Leung, J.Y.T. (ed.) Handbook of Scheduling: Algorithms, Models, and Performance Analysis, ch. 34, pp. 1\u201316. CRC Press, Boca Raton (2004)"},{"key":"19_CR21","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"Pesch, E., Glover, F.: TSP Ejection Chains. Discrete Applied Mathematics\u00a076, 165\u2013181 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR22","volume-title":"Operation Scheduling with Applications in Manufacturing and Services","author":"M. Pinedo","year":"1999","unstructured":"Pinedo, M., Chao, X.: Operation Scheduling with Applications in Manufacturing and Services. Irwin\/McGraw-Hill, Boston (1999)"},{"key":"19_CR23","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":"19_CR24","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":"19_CR25","volume-title":"Problems and Algorithms in Non-Classical Shop Scheduling","author":"M. Sterna","year":"2000","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","KI 2005: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11551263_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,18]],"date-time":"2021-07-18T03:30:54Z","timestamp":1626579054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11551263_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540287612","9783540318187"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11551263_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}