{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T18:25:44Z","timestamp":1781375144499,"version":"3.54.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Poland-China Scientific & Technological Cooperation Project 37-19 and Poznan University of Technology grant","award":["20170520306"],"award-info":[{"award-number":["20170520306"]}]},{"name":"Poland-China Scientific & Technological Cooperation Project 37-19 and Poznan University of Technology grant","award":["09\/91\/DSPB\/0649"],"award-info":[{"award-number":["09\/91\/DSPB\/0649"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10951-020-00636-9","type":"journal-article","created":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T19:03:26Z","timestamp":1580411006000},"page":"483-487","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Mirror scheduling problems with early work and late work criteria"],"prefix":"10.1007","volume":"24","author":[{"given":"Xin","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergey","family":"Kovalev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ma\u0142gorzata","family":"Sterna","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,1,30]]},"reference":[{"issue":"15\u201316","key":"636_CR1","doi-asserted-by":"publisher","first-page":"3975","DOI":"10.1016\/j.apm.2014.01.006","volume":"38","author":"F Abasian","year":"2014","unstructured":"Abasian, F., Ranjbar, M., Salari, M., Davari, M., & Khatami, S. M. (2014). Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays. Applied Mathematical Modelling, 38(15\u201316), 3975\u20133986.","journal-title":"Applied Mathematical Modelling"},{"issue":"1\u20134","key":"636_CR2","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/B:ANOR.0000030679.25466.02","volume":"129","author":"MA Aloulou","year":"2004","unstructured":"Aloulou, M. A., Kovalyov, M. Y., & Portmann, M.-C. (2004). Maximization problems in single machine scheduling. Annals of Operations Research, 129(1\u20134), 21\u201332.","journal-title":"Annals of Operations Research"},{"key":"636_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cor.2016.03.010","volume":"73","author":"Y Ben-Yehoshua","year":"2016","unstructured":"Ben-Yehoshua, Y., & Mosheiov, G. (2016). A single machine scheduling problem to minimize total early work. Computers and Operations Research, 73, 115\u2013118.","journal-title":"Computers and Operations Research"},{"issue":"6","key":"636_CR4","first-page":"415","volume":"3","author":"J B\u0142a\u017cewicz","year":"1984","unstructured":"B\u0142a\u017cewicz, 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"},{"issue":"6","key":"636_CR5","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10951-015-0464-7","volume":"19","author":"X Chen","year":"2016","unstructured":"Chen, X., Sterna, M., Han, X., & B\u0142a\u017cewicz, J. (2016). Scheduling on parallel identical machines with late work criterion: Offline and online cases. Journal of Scheduling, 19(6), 729\u2013736.","journal-title":"Journal of Scheduling"},{"issue":"2","key":"636_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0020-0190(97)00195-6","volume":"65","author":"TCE Cheng","year":"1998","unstructured":"Cheng, T. C. E., & Ding, Q. (1998). The complexity of scheduling starting time dependent tasks with release times. Information Processing Letters, 65(2), 75\u201379.","journal-title":"Information Processing Letters"},{"issue":"1","key":"636_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TCE Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152(1), 1\u201313.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"636_CR8","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y.-T. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15(3), 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"issue":"1","key":"636_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10479-011-1055-4","volume":"196","author":"ER Gafarov","year":"2012","unstructured":"Gafarov, E. R., Lazarev, A. A., & Werner, F. (2012). Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. Annals of Operations Research, 196(1), 247\u2013261.","journal-title":"Annals of Operations Research"},{"key":"636_CR10","volume-title":"Inequalities","author":"GH Hardy","year":"1934","unstructured":"Hardy, G. H., Littlewood, J. E., & P\u00f3lya, G. (1934). Inequalities. Cambridge: Cambridge University Press."},{"issue":"5","key":"636_CR11","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1109\/TSMCA.2007.893485","volume":"37","author":"A Janiak","year":"2007","unstructured":"Janiak, A., Kovalyov, M. Y., & Marek, M. (2007). Soft due window assignment and scheduling on parallel machines. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans, 37(5), 614\u2013620.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans"},{"issue":"3","key":"636_CR12","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.ejor.2015.04.006","volume":"245","author":"C Koulamas","year":"2015","unstructured":"Koulamas, C. (2015). A note on scheduling problems with competing agents and earliness minimization objectives. European Journal of Operational Research, 245(3), 875\u2013876.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"636_CR13","doi-asserted-by":"publisher","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":"636_CR14","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume-title":"Logistics of production and inventory. Handbook in operations research and management science","author":"EL Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: Algorithms and complexity. In S. C. Graves, A. H. G. RinnooyKan, & P. H. Zipkin (Eds.), Logistics of production and inventory. Handbook in operations research and management science (Vol. 4, pp. 445\u2013452). Amsterdam: Elsevier."},{"key":"636_CR15","volume-title":"Knapsack problems: Algorithms and computer implementation","author":"S Martello","year":"1990","unstructured":"Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementation. New York, NY: Wiley."},{"issue":"3","key":"636_CR16","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1287\/opre.40.3.586","volume":"40","author":"CN Potts","year":"1992","unstructured":"Potts, C. N., & Van Wassenhove, L. N. (1992). Single machine scheduling to minimize total late work. Operations Research, 40(3), 586\u2013595.","journal-title":"Operations Research"},{"issue":"23","key":"636_CR17","doi-asserted-by":"publisher","first-page":"9776","DOI":"10.1016\/j.apm.2013.05.013","volume":"37","author":"M Ranjbar","year":"2013","unstructured":"Ranjbar, M., Hosseinabadi, S., & Abasian, F. (2013). Minimizing total weighted late work in the resource-constrained project scheduling problem. Applied Mathematical Modelling, 37(23), 9776\u20139785.","journal-title":"Applied Mathematical Modelling"},{"issue":"2","key":"636_CR18","doi-asserted-by":"publisher","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":"5\u20136","key":"636_CR19","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1057\/palgrave.jors.2600481","volume":"49","author":"R Tadei","year":"1998","unstructured":"Tadei, R., Gupta, J. N. D., Della Croce, F., & Cortesi, M. (1998). Minimizing makespan in the two-machine flow-shop with release times. Journal of the Operational Research Society, 49(5\u20136), 77\u201385.","journal-title":"Journal of the Operational Research Society"},{"issue":"782","key":"636_CR20","first-page":"1","volume":"24","author":"Z Xu","year":"2015","unstructured":"Xu, Z., Zou, Y., & Kong, X. (2015). Metaheuristic algorithms for parallel identical machines scheduling problem with weighted late work criterion and common due date. SpringerPlus, 24(782), 1\u201313.","journal-title":"SpringerPlus"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00636-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-020-00636-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-020-00636-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T11:27:02Z","timestamp":1634297222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-020-00636-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,30]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["636"],"URL":"https:\/\/doi.org\/10.1007\/s10951-020-00636-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,30]]},"assertion":[{"value":"30 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}