{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T03:53:10Z","timestamp":1769313190256,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T00:00:00Z","timestamp":1584403200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T00:00:00Z","timestamp":1584403200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s40314-020-1130-z","type":"journal-article","created":{"date-parts":[[2020,3,17]],"date-time":"2020-03-17T08:02:42Z","timestamp":1584432162000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Regular scheduling measures on proportionate flowshop with job rejection"],"prefix":"10.1007","volume":"39","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-2320-9064","authenticated-orcid":false,"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,17]]},"reference":[{"issue":"4","key":"1130_CR1","doi-asserted-by":"publisher","first-page":"885","DOI":"10.1007\/s11590-016-1059-8","volume":"11","author":"A Agnetis","year":"2017","unstructured":"Agnetis A, Mosheiov G (2017) Scheduling with job-rejection and position-dependent processing times on proportionate flowshops. Optim Lett 11(4):885\u2013892","journal-title":"Optim Lett"},{"key":"1130_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.cie.2018.01.027","volume":"117","author":"C-Y Cheng","year":"2018","unstructured":"Cheng C-Y, Ying K-C, Chen H-H, Lin J-X (2018) Optimization algorithms for proportionate flowshop scheduling problems with variable maintenance activities. Comput Ind Eng 117:164\u2013170","journal-title":"Comput Ind Eng"},{"key":"1130_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ipl.2017.12.004","volume":"132","author":"S Fiszman","year":"2018","unstructured":"Fiszman S, Mosheiov G (2018) Minimizing total load on a proportionate flowshop with position-dependent processing times and job rejection. Inf Process Lett 132:39\u201343","journal-title":"Inf Process Lett"},{"issue":"11","key":"1130_CR4","doi-asserted-by":"publisher","first-page":"3164","DOI":"10.1080\/00207543.2016.1266055","volume":"55","author":"E Gerstl","year":"2015","unstructured":"Gerstl E, Mosheiov G (2015) Single machine scheduling problems with generalised due-dates and job-rejection. Int J Prod Res 55(11):3164\u20133172","journal-title":"Int J Prod Res"},{"issue":"2","key":"1130_CR5","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.ipl.2014.09.004","volume":"115","author":"E Gerstl","year":"2015","unstructured":"Gerstl E, Mor B, Mosheiov G (2015) A note: maximizing the weighted number of just-in-time jobs on a proportionate flowshop. Inf Process Lett 115(2):159\u2013162","journal-title":"Inf Process Lett"},{"key":"1130_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2017.02.010","volume":"83","author":"E Gerstl","year":"2017","unstructured":"Gerstl E, Mor B, Mosheiov G (2017) Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection. Comput Oper Res 83:150\u2013156","journal-title":"Comput Oper Res"},{"issue":"2","key":"1130_CR7","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1080\/00207543.2018.1456693","volume":"57","author":"E Gerstl","year":"2019","unstructured":"Gerstl E, Mor B, Mosheiov G (2019) Scheduling on a proportionate flowshop to minimise total late work. Int J Prod Res 57(2):531\u2013543","journal-title":"Int J Prod Res"},{"key":"1130_CR8","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"RL Graham","year":"1979","unstructured":"Graham RL, Lawler EL, Lenstra JK (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discr Math 4:287\u2013326","journal-title":"Ann Discr Math"},{"key":"1130_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2015.04.014","volume":"87","author":"C Koulamas","year":"2015","unstructured":"Koulamas C, Panwalkar SS (2015) On the equivalence of single machine earliness\/tardiness problems with job rejection. Comput Ind Eng 87:1\u20133","journal-title":"Comput Ind Eng"},{"issue":"4","key":"1130_CR10","doi-asserted-by":"publisher","first-page":"1750015","DOI":"10.1142\/S0217595917500154","volume":"34","author":"SS Li","year":"2017","unstructured":"Li SS, Qian DL, Chen RX (2017) Proportionate Flow Shop Scheduling with Rejection. Asia-Pac J Oper Res 34(4):1750015","journal-title":"Asia-Pac J Oper Res"},{"issue":"1","key":"1130_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1057\/jors.2013.9","volume":"65","author":"B Mor","year":"2014","unstructured":"Mor B, Mosheiov G (2014) Polynomial time solutions for scheduling problems on a proportionate flowshop with two competing agents. J Oper Res Soc 65(1):151\u2013157","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1130_CR12","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/j.ipl.2014.09.023","volume":"115","author":"B Mor","year":"2015","unstructured":"Mor B, Mosheiov G (2015a) A note: minimizing maximum earliness on a proportionate flowshop. Inf Process Lett 115(2):253\u2013255","journal-title":"Inf Process Lett"},{"issue":"9","key":"1130_CR13","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1057\/jors.2014.112","volume":"66","author":"B Mor","year":"2015","unstructured":"Mor B, Mosheiov G (2015b) Minimizing the number of early jobs on a proportionate flowshop. J Oper Res Soc 66(9):1426\u20131429","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1130_CR14","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.ejor.2016.03.037","volume":"254","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016a) Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance. Eur J Oper Res 254(2):360\u2013370","journal-title":"Eur J Oper Res"},{"issue":"12","key":"1130_CR15","doi-asserted-by":"publisher","first-page":"1524","DOI":"10.1057\/s41274-016-0003-8","volume":"67","author":"B Mor","year":"2016","unstructured":"Mor B, Mosheiov G (2016b) Minimizing maximum cost on a single machine with two competing agents and job rejection. J Oper Res Soc 67(12):1524\u20131531","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1130_CR16","doi-asserted-by":"publisher","first-page":"1079","DOI":"10.1007\/s10479-018-2779-1","volume":"271","author":"B Mor","year":"2018","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. Ann Oper Res 271(2):1079\u20131085","journal-title":"Ann Oper Res"},{"key":"1130_CR100","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-019-00612-y","author":"B Mor","year":"2019","unstructured":"Mor B, Mosheiov G, Shapira D (2019) Flowshop scheduling with learning effect and job rejection. J Sched. https:\/\/doi.org\/10.1007\/s10951-019-00612-y","journal-title":"J Sched"},{"issue":"11","key":"1130_CR17","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1080\/01605682.2018.1506540","volume":"70","author":"B Mor","year":"2019","unstructured":"Mor B, Shapira D (2019) Improved algorithms for scheduling on proportionate flowshop with job-rejection. J Oper Res Soc 70(11):1997\u20132003","journal-title":"J Oper Res Soc"},{"issue":"2","key":"1130_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1002\/nav.21615","volume":"62","author":"SS Panwalkar","year":"2015","unstructured":"Panwalkar SS, Koulamas C (2015) Proportionate flow shop: new complexity results and models with due date assignment. Naval Res Log 62(2):98\u2013106","journal-title":"Naval Res Log"},{"key":"1130_CR19","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.cie.2017.03.013","volume":"107","author":"SS Panwalkar","year":"2017","unstructured":"Panwalkar SS, Koulamas C (2017) On the dominance of permutation schedules for some ordered and proportionate flow shop problem. Comput Ind Eng 107:105\u2013108","journal-title":"Comput Ind Eng"},{"issue":"1","key":"1130_CR20","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1002\/nav.21518","volume":"60","author":"SS Panwalkar","year":"2013","unstructured":"Panwalkar SS, Smith ML, Koulamas C (2013) Review of the ordered and proportionate flow shop scheduling research. Naval Res Log 60(1):46\u201355","journal-title":"Naval Res Log"},{"key":"1130_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: theory, algorithms and systems","author":"ML Pinedo","year":"2016","unstructured":"Pinedo ML (2016) Scheduling: theory, algorithms and systems, 5th edn. Springer, New-York","edition":"5"},{"issue":"1","key":"1130_CR22","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.ejor.2013.08.013","volume":"233","author":"D Shabtay","year":"2014","unstructured":"Shabtay D (2014) The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost. Eur J Oper Res 233(1):64\u201374","journal-title":"Eur J Oper Res"},{"issue":"5","key":"1130_CR23","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1057\/jors.2015.95","volume":"67","author":"D Shabtay","year":"2016","unstructured":"Shabtay D, Oron D (2016) Proportionate flow-shop scheduling with rejection. J Oper Res Soc 67(5):752\u2013769","journal-title":"J Oper Res Soc"},{"key":"1130_CR24","doi-asserted-by":"publisher","first-page":"395","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 job rejection and positional penalties. J Comb Optim 23:395\u2013424","journal-title":"J Comb Optim"},{"key":"1130_CR25","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. J Sched 16:3\u201328","journal-title":"J Sched"},{"key":"1130_CR26","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. Theoret Comput Sci 411:1877\u20131882","journal-title":"Theoret Comput Sci"},{"key":"1130_CR27","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1007\/s10878-016-0016-x","volume":"33","author":"X Zhong","year":"2017","unstructured":"Zhong X, Pan Z, Jiang D (2017) Scheduling with release times and rejection on two parallel machines. J Comb Optim 33:934\u2013944","journal-title":"J Comb Optim"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-1130-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-020-1130-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-1130-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,17]],"date-time":"2021-03-17T00:18:16Z","timestamp":1615940296000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-020-1130-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,17]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["1130"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-1130-z","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,17]]},"assertion":[{"value":"11 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 March 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"107"}}