{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T20:58:15Z","timestamp":1777755495350,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T00:00:00Z","timestamp":1627257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10951-021-00697-4","type":"journal-article","created":{"date-parts":[[2021,7,26]],"date-time":"2021-07-26T06:02:20Z","timestamp":1627279340000},"page":"553-567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9052-9375","authenticated-orcid":false,"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2709-599X","authenticated-orcid":false,"given":"Dvir","family":"Shabtay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,26]]},"reference":[{"key":"697_CR1","doi-asserted-by":"crossref","unstructured":"Chubanov, S., Kovalyov, M., & Pesch, E. (2006). An FPTAS for a single-item capacity economic lot-sizing problem with monotone cost structure. Mathematical Programming, Series A, 106, 453\u2013466.","DOI":"10.1007\/s10107-005-0641-0"},{"issue":"1","key":"697_CR2","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/ijoc.2017.0772","volume":"30","author":"R Cordone","year":"2017","unstructured":"Cordone, R., Hosteins, P., & Righini, G. (2017). A branch-and-bound algorithm for the prize-collecting single-machine scheduling problem with deadlines and total tardiness minimization. INFORMS Journal on Computing, 30(1), 168\u2013180.","journal-title":"INFORMS Journal on Computing"},{"key":"697_CR3","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.cor.2018.10.006","volume":"102","author":"R Cordone","year":"2019","unstructured":"Cordone, R., & Hosteins, P. (2019). A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization. Computers and Operations Research, 102, 130\u2013140.","journal-title":"Computers and Operations Research"},{"key":"697_CR4","doi-asserted-by":"crossref","unstructured":"Du, W., Eppstein, D., Goodrich, M. T., & Lueker, G. S. (2009). On the approximability of geometric and geographic generalization and the min-max bin covering problem. In F. Dehne, M. Gavrilova, J. R. Sack, & C. D. T \u00f2th (Eds.) Algorithms and Data Structures. WADS. Lecture Notes in Computer Science (Vol. 5664). Springer.","DOI":"10.1007\/978-3-642-03367-4_22"},{"key":"697_CR5","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, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"issue":"11","key":"697_CR6","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., & Mosheiov, G. (2017). Single machine scheduling problems with generalised due-dates and job-rejection. International Journal of Production Research, 55(11), 3164\u20133172.","journal-title":"International Journal of Production Research"},{"issue":"3","key":"697_CR7","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10951-020-00638-7","volume":"23","author":"E Gerstl","year":"2020","unstructured":"Gerstl, E., & Mosheiov, G. (2020). Single machine scheduling to maximize the number of on-time jobs with generalized due-dates. Journal of Scheduling, 23(3), 289\u2013299.","journal-title":"Journal of Scheduling"},{"key":"697_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"NG Hall","year":"1986","unstructured":"Hall, N. G. (1986). Scheduling problems with generalized due dates. IIE Transactions, 18, 220\u2013222.","journal-title":"IIE Transactions"},{"key":"697_CR9","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","volume":"51","author":"NG Hall","year":"1991","unstructured":"Hall, N. G., Sethi, S. P., & Sriskandarajah, C. (1991). On the complexity of generalized due-date scheduling problems. European Journal of Operational Research, 51, 100\u2013109.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"697_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.ejor.2018.07.038","volume":"273","author":"D Hermelin","year":"2019","unstructured":"Hermelin, D., Pinedo, M., Talmon, N., & Shabtay, D. (2019). On the parameterized tractability of single machine scheduling with rejection. European Journal of Operations Research, 273(1), 67\u201373.","journal-title":"European Journal of Operations Research"},{"key":"697_CR11","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"OH Ibarra","year":"1975","unstructured":"Ibarra, O. H., & Kim, C. E. (1975). Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22, 463\u2013468.","journal-title":"Journal of the ACM"},{"key":"697_CR12","doi-asserted-by":"crossref","unstructured":"Mor, B., & Mosheiov, G. (2018). A note: Minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection. Annals of Operations Research, 271(2), 1079\u20131085.","DOI":"10.1007\/s10479-018-2779-1"},{"key":"697_CR13","doi-asserted-by":"publisher","unstructured":"Mor, B., & Mosheiov, G.A Note: Flowshop scheduling with linear deterioration and job-rejection. 4OR- A Quarterly Journal of Operations Research. https:\/\/doi.org\/10.1007\/s10288-020-00436-z.","DOI":"10.1007\/s10288-020-00436-z"},{"key":"697_CR14","doi-asserted-by":"publisher","unstructured":"Mor, B., Mosheiov, G., & Shapira, D. (2019). Flowshop scheduling with learning effect and job rejection. Journal of Scheduling. https:\/\/doi.org\/10.1007\/s10951-019-00612-y.","DOI":"10.1007\/s10951-019-00612-y"},{"issue":"2","key":"697_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40314-020-1130-z","volume":"39","author":"B Mor","year":"2020","unstructured":"Mor, B., & Shapira, D. (2020). Regular scheduling measures on proportionate flowshop with job rejection. Computational and Applied Mathematics, 39(2), 1\u201314.","journal-title":"Computational and Applied Mathematics"},{"issue":"5","key":"697_CR16","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/S0305-0548(03)00018-2","volume":"31","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov, G., & Oron, D. (2004). A note on the SPT heuristic for solving scheduling problems with generalized due dates. Computers and Operations Research, 31(5), 645\u2013655.","journal-title":"Computers and Operations Research"},{"key":"697_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102313","author":"D Oron","year":"2020","unstructured":"Oron, D. (2020). Two-agent scheduling problems under rejection budget constraints. Omega,. https:\/\/doi.org\/10.1016\/j.omega.2020.102313.","journal-title":"Omega"},{"issue":"1\u20133","key":"697_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0166-218X(01)00316-X","volume":"122","author":"X Qi","year":"2002","unstructured":"Qi, X., Yu, G., & Bard, J. F. (2002). Single machine scheduling with assignable due dates. Discrete Applied Mathematics, 122(1\u20133), 211\u2013233.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"697_CR19","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116\u2013127.","journal-title":"Journal of the ACM"},{"key":"697_CR20","unstructured":"Shabtai, G., Raz, D., & Shavitt, Y. (2018). A relaxed FPTAS for chance-constrained knapsack. In 29th International Symposium on Algorithms and Computation."},{"issue":"4","key":"697_CR21","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10878-010-9350-6","volume":"23","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., Gaspar, N., & Yedidsion, L. (2012). A bicriteria approach to scheduling a single machine with rejection and positional penalties. Journal of Combinatorial Optimization, 23(4), 39\u201347.","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"697_CR22","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., & Kaspi, M. (2013). A survey on offline scheduling with rejection. Journal of scheduling, 16(1), 3\u201328.","journal-title":"Journal of scheduling"},{"key":"697_CR23","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N Shakhlevich","year":"1998","unstructured":"Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1, 157\u2013168.","journal-title":"Journal of Scheduling"},{"key":"697_CR24","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1002\/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-O","volume":"37","author":"C Sriskandarajah","year":"1990","unstructured":"Sriskandarajah, C. (1990). A note on the generalized due-dates scheduling problems. Naval Research Logistics, 37, 587\u2013597.","journal-title":"Naval Research Logistics"},{"issue":"3","key":"697_CR25","first-page":"557","volume":"80","author":"K Tanaka","year":"1997","unstructured":"Tanaka, K., & Vlach, M. (1997). Single machine scheduling to minimize the maximum lateness with both specific and generalized due dates. Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 80(3), 557\u2013563.","journal-title":"Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"697_CR26","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1023\/A:1018987625819","volume":"86","author":"K Tanaka","year":"1999","unstructured":"Tanaka, K., & Vlach, M. (1999). Minimizing maximum absolute lateness and range of lateness under generalized due-dates on a single machine. Annals of Operations Research, 86, 507\u2013526.","journal-title":"Annals of Operations Research"},{"key":"697_CR27","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.omega.2018.04.008","volume":"81","author":"D Wang","year":"2020","unstructured":"Wang, D., Yin, Y., & Jin, Y. (2020). Parallel-machine rescheduling with job unavailability and rejection. Omega, 81, 246\u2013260.","journal-title":"Omega"},{"key":"697_CR28","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1016\/j.amc.2012.08.008","volume":"219","author":"Y Yin","year":"2012","unstructured":"Yin, Y., Cheng, S. R., Cheng, T. C. E., Wu, C. C., & Wu, W. H. (2012). Two-agent single-machine scheduling with assignable due-dates. Applied Mathematics and Computation, 219, 1674\u20131685.","journal-title":"Applied Mathematics and Computation"},{"key":"697_CR29","doi-asserted-by":"publisher","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang, L., Lu, L., & Yuan, J. (2010). Single-machine scheduling under the job rejection constraint. Theoretical Computer Science, 411, 1877\u20131882.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00697-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-021-00697-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00697-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,16]],"date-time":"2021-11-16T08:16:52Z","timestamp":1637050612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-021-00697-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,26]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["697"],"URL":"https:\/\/doi.org\/10.1007\/s10951-021-00697-4","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7,26]]},"assertion":[{"value":"1 July 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 July 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}