{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T18:25:46Z","timestamp":1781375146014,"version":"3.54.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T00:00:00Z","timestamp":1450656000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC (61300016)"],"award-info":[{"award-number":["NSFC (61300016)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["NSFC (11101065)"],"award-info":[{"award-number":["NSFC (11101065)"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10951-015-0464-7","type":"journal-article","created":{"date-parts":[[2015,12,21]],"date-time":"2015-12-21T01:38:07Z","timestamp":1450661887000},"page":"729-736","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":54,"title":["Scheduling on parallel identical machines with late work criterion: Offline and online cases"],"prefix":"10.1007","volume":"19","author":[{"given":"Xin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Malgorzata","family":"Sterna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xin","family":"Han","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacek","family":"Blazewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,12,21]]},"reference":[{"issue":"6","key":"464_CR1","first-page":"415","volume":"3","author":"J Blazewicz","year":"1984","unstructured":"Blazewicz, J. (1984). Scheduling preemptible tasks on parallel processors with information loss. Technique et Science Informatiques, 3(6), 415\u2013420.","journal-title":"Technique et Science Informatiques"},{"key":"464_CR2","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Bouvry, P., Kovalyov, M.Y. & Musial, J. (2014). Internet shopping with price sensitive discounts. 4OR-A Quarterly Journal of Operations Research, 12(1), 35\u201348.","DOI":"10.1007\/s10288-013-0230-7"},{"issue":"4","key":"464_CR3","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(87)90145-1","volume":"24","author":"J Blazewicz","year":"1987","unstructured":"Blazewicz, J., & Finke, G. (1987). Minimizing mean weighted execution time loss on identical and uniform processors. Information Processing Letters, 24(4), 259\u2013263.","journal-title":"Information Processing Letters"},{"key":"464_CR4","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Musial, J. (2011). E-commerce evaluation \u2013 multi-item internet shopping. Optimization and heuristic algorithms. In B. Hu, K. Morasch, S. Pickl & M. Siegle (Eds.), Operations research proceedings 2010 (pp. 149\u2013154), Berlin: Springer.","DOI":"10.1007\/978-3-642-20009-0_24"},{"key":"464_CR5","doi-asserted-by":"crossref","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2000). Total late work criteria for shop scheduling problems. In K. Inderfurth, G. Schwoediauer, W. Domschke, F. Juhnke, P. Kleinschmidt, & G. Waescher (Eds.), Operations research proceedings 1999 (pp. 354\u2013359). Berlin: Springer.","DOI":"10.1007\/978-3-642-58300-1_54"},{"issue":"1","key":"464_CR6","doi-asserted-by":"crossref","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. (2004). Open shop scheduling problems with late work criteria. Discrete Applied Mathematics, 134(1), 1\u201324.","journal-title":"Discrete Applied Mathematics"},{"key":"464_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-540-30176-9_9","volume":"3285","author":"J Blazewicz","year":"2004","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2004). Flow shop scheduling with late work criterion - choosing the best solution strategy. Lecture Notes in Computer Science, 3285, 68\u201375.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"464_CR8","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1016\/j.ejor.2004.04.011","volume":"165","author":"J Blazewicz","year":"2005","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2005). The two-machine flow-shop problem with weighted late work criterion and common due date. European Journal of Operational Research, 165(2), 408\u2013415.","journal-title":"European Journal of Operational Research"},{"key":"464_CR9","first-page":"222","volume":"3698","author":"J Blazewicz","year":"2005","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2005). Metaheuristics for late work minimization in two-machine flow shop with common due date. Lecture Notes in Artificial Intelligence, 3698, 222\u2013234.","journal-title":"Lecture Notes in Artificial Intelligence"},{"issue":"4","key":"464_CR10","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.cie.2005.09.001","volume":"49","author":"J Blazewicz","year":"2005","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2005). A comparison of solution procedures for two-machine flow shop scheduling with late work criterion. Computers and Industrial Engineering, 49(4), 611\u2013624.","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"464_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10951-006-0005-5","volume":"10","author":"J Blazewicz","year":"2007","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2007). A note on the two machine job shop with the weighted late work criterion. Journal of Scheduling, 10(2), 87\u201395.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"464_CR12","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.cor.2006.03.021","volume":"35","author":"J Blazewicz","year":"2008","unstructured":"Blazewicz, J., Pesch, E., Sterna, M., & Werner, F. (2008). Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date. Computers and Operations Research, 35(2), 574\u2013599.","journal-title":"Computers and Operations Research"},{"key":"464_CR13","volume-title":"Online computation and competitive analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., & El-Yaniv, R. (1998). Online computation and competitive analysis. Cambridge: Cambridge University Press."},{"issue":"45","key":"464_CR14","doi-asserted-by":"crossref","first-page":"6269","DOI":"10.1016\/j.tcs.2011.07.014","volume":"412","author":"X Chen","year":"2011","unstructured":"Chen, X., Lan, Y., Benko, A., Dosa, G., & Han, X. (2011). Optimal algorithms for online scheduling with bounded rearrangement at the end. Theoretical Computer Science, 412(45), 6269\u20136278.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"464_CR15","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1287\/opre.17.4.701","volume":"17","author":"H Emmons","year":"1969","unstructured":"Emmons, H. (1969). One-machine sequencing to minimize certain functions of job tardiness. Operations Research, 17(4), 701\u2013715.","journal-title":"Operations Research"},{"key":"464_CR16","doi-asserted-by":"crossref","unstructured":"Englert, M., Ozmen, D., & Westermann, M. (2008). The power of reordering for online minimum makespan scheduling. In Proceedings of 48th IEEE symposium foundations of computer science (FOCS) (pp. 603\u2013612).","DOI":"10.1109\/FOCS.2008.46"},{"key":"464_CR17","doi-asserted-by":"crossref","unstructured":"Fiat, A., & Woeginger, G. (Eds.) (1998). Online algorithms: The state of the art. Lecture Notes in Computer Science, 1442.","DOI":"10.1007\/BFb0029561"},{"key":"464_CR18","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and Intractability: A guide to the theory of NP-Completeness. New York: WH Freeman and Company."},{"key":"464_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Kan, A. H. G. (1979). Optimization and approximation in deterministic sequencing and scheduling: a survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"2","key":"464_CR20","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1287\/ijoc.7.2.232","volume":"7","author":"AMA Hariri","year":"1995","unstructured":"Hariri, A. M. A., Potts, C. N., & Van Wassenhove, L. N. (1995). Single machine scheduling to minimize total weighted late work. ORSA Journal on Computing, 7(2), 232\u2013242.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"464_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0166-218X(90)90093-R","volume":"28","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D. S., & Shamir, R. (1990). Minimizing the number of tardy job units under release time constraints. Discrete Applied Mathematics, 28(1), 45\u201357.","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"464_CR22","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0360-8352(02)00123-7","volume":"43","author":"RB Kethley","year":"2002","unstructured":"Kethley, R. B., & Alidaee, B. (2002). Single machine scheduling to minimize total weighted late work: A comparison of scheduling rules and search algorithms. Computers and Industrial Engineering, 43(3), 509\u2013528.","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"464_CR23","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/moor.19.1.86","volume":"19","author":"MY Kovalyov","year":"1994","unstructured":"Kovalyov, M. Y., Potts, C. N., & Van Wassenhove, L. N. (1994). A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work. Mathematics of Operations Research, 19(1), 86\u201393.","journal-title":"Mathematics of Operations Research"},{"key":"464_CR24","doi-asserted-by":"crossref","unstructured":"Lan, Y., Chen, X., Ding, N., Dosa, G., & Han, X. (2012). Online minimum makespan scheduling with a buffer. In J. Snoeyink, P. Lu, K. Su, & L. Wang (Eds.), Proceeding of FAW-AAIM (pp. 161\u2013171). Beijing: Springer.","DOI":"10.1007\/978-3-642-29700-7_15"},{"key":"464_CR25","doi-asserted-by":"crossref","first-page":"34.1","DOI":"10.1201\/9780203489802","volume-title":"Handbook of scheduling: algorithms, models, and performance analysis","author":"JYT Leung","year":"2004","unstructured":"Leung, J. Y. T. (2004). Minimizing total weighted error for imprecise computation tasks and related problems. In J. Y. T. Leung (Ed.), Handbook of scheduling: algorithms, models, and performance analysis (pp. 34.1\u201334.16). Boca Raton: CRC Press."},{"key":"464_CR26","unstructured":"Lin, BMT., Hsu, SW. (2005). Minimizing total late work on a single machine with release and due dates. In SIAM conference on computational science and engineering, Orlando."},{"issue":"4","key":"464_CR27","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1080\/03052150500420439","volume":"38","author":"BMT Lin","year":"2006","unstructured":"Lin, B. M. T., Lin, F. C., & Lee, R. C. T. (2006). Two-machine flow-shop scheduling to minimize total late work. Engineering Optimization, 38(4), 501\u2013509.","journal-title":"Engineering Optimization"},{"key":"464_CR28","doi-asserted-by":"crossref","unstructured":"Moore, J. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102\u2013109.","DOI":"10.1287\/mnsc.15.1.102"},{"issue":"3","key":"464_CR29","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1287\/opre.23.3.475","volume":"23","author":"G McMahon","year":"1975","unstructured":"McMahon, G., & Florian, M. (1975). On scheduling with ready times and due dates to minimize maximum lateness. Operations Research, 23(3), 475\u2013482.","journal-title":"Operations Research"},{"key":"464_CR30","doi-asserted-by":"crossref","unstructured":"Pesch, E., & Sterna, M. (2009). Late work minimization in flow shop by a genetic algorithm. Computers and Industrial Engineering, 57(4), 1202\u20131209.","DOI":"10.1016\/j.cie.2009.05.011"},{"issue":"3","key":"464_CR31","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1991","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1991). Single machine scheduling to minimize total late work. Operations Research, 40(3), 586\u2013595.","journal-title":"Operations Research"},{"issue":"3","key":"464_CR32","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1142\/S0217595909002249","volume":"26","author":"J Ren","year":"2009","unstructured":"Ren, J., Zhang, Y., & Sun, G. (2009). The NP-hardness of minimizing the total late work on an unbounded batch machine. Asia-Pacific Journal of Operational Research, 26(3), 351\u2013363.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"464_CR33","first-page":"59","volume":"55","author":"M Sterna","year":"2007","unstructured":"Sterna, M. (2007). Dominance relations for two-machine flow-shop problem with late work criterion. Bulletin of the Polish Academy of Sciences, 55(1), 59\u201369.","journal-title":"Bulletin of the Polish Academy of Sciences"},{"issue":"2","key":"464_CR34","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.cie.2006.12.004","volume":"52","author":"M Sterna","year":"2007","unstructured":"Sterna, M. (2007). Late work minimization in a small flexible manufacturing system. Computers and Industrial Engineering, 52(2), 210\u2013228.","journal-title":"Computers and Industrial Engineering"},{"issue":"2","key":"464_CR35","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.omega.2010.06.006","volume":"39","author":"M Sterna","year":"2011","unstructured":"Sterna, M. (2011). A survey of scheduling problems with late work criteria. Omega, 39(2), 120\u2013129.","journal-title":"Omega"},{"issue":"2","key":"464_CR36","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.orl.2007.06.004","volume":"36","author":"Z Tan","year":"2008","unstructured":"Tan, Z., & Yu, S. (2008). Online scheduling with reassignment. Operations Research Letters, 36(2), 250\u2013254.","journal-title":"Operations Research Letters"},{"key":"464_CR37","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1007\/978-1-4419-7997-1_2","volume-title":"Handbook of Combinatorial Optimization","author":"Z Tan","year":"2013","unstructured":"Tan, Z., & Zhang, A. (2013). Online and semi-online scheduling. In P. M. Pardalos, et al. (Eds.), Handbook of Combinatorial Optimization (pp. 2191\u20132252). New York: Springer."},{"issue":"1","key":"464_CR38","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","volume":"12","author":"GJ Woeginger","year":"2000","unstructured":"Woeginger, G. J. (2000). When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS Journal on Computing, 12(1), 57\u201374.","journal-title":"INFORMS Journal on Computing"},{"key":"464_CR39","doi-asserted-by":"crossref","unstructured":"Wojciechowski, A., Musial, J. (2010). Towards optimal multi-item shopping basket management: Heuristic approach. Lecture Notes in Computer Science, 6428, 349\u2013357.","DOI":"10.1007\/978-3-642-16961-8_54"},{"issue":"1","key":"464_CR40","first-page":"13","volume":"25","author":"Y Zhang","year":"2005","unstructured":"Zhang, Y., & Wang, L. (2005). The NP-completeness of a new batch scheduling problem. Journal of Systems Science and Mathematical Sciences, 25(1), 13\u201317.","journal-title":"Journal of Systems Science and Mathematical Sciences"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0464-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0464-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0464-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0464-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:07:21Z","timestamp":1653869241000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0464-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,21]]},"references-count":40,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["464"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0464-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,21]]}}}