{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T15:03:17Z","timestamp":1772550197090,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T00:00:00Z","timestamp":1563408000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T00:00:00Z","timestamp":1563408000000},"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":["J Sched"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10951-019-00612-y","type":"journal-article","created":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T17:02:40Z","timestamp":1563469360000},"page":"631-641","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":37,"title":["Flowshop scheduling with learning effect and job rejection"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6909-8160","authenticated-orcid":false,"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]},{"given":"Dana","family":"Shapira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,18]]},"reference":[{"key":"612_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. Optimization Letters, 11, 885\u2013892.","journal-title":"Optimization Letters"},{"key":"612_CR2","doi-asserted-by":"publisher","first-page":"1642","DOI":"10.1080\/00207543.2017.1355576","volume":"56","author":"A Azzouz","year":"2018","unstructured":"Azzouz, A., Ennigrou, M., & Ben Said, L. (2018). Scheduling problems under learning effects: Classification and cartography. International Journal of Production Research, 56, 1642\u20131661.","journal-title":"International Journal of Production Research"},{"key":"612_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173\u2013178.","journal-title":"European Journal of Operational Research"},{"key":"612_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D Biskup","year":"2008","unstructured":"Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315\u2013329.","journal-title":"European Journal of Operational Research"},{"key":"612_CR7","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.ipl.2015.11.012","volume":"116","author":"E Epstein","year":"2016","unstructured":"Epstein, E., & Zebedat-Haider, H. (2016). Online scheduling of unit jobs on three machines with rejection: A tight result. Information Processing Letters, 116, 252\u2013255.","journal-title":"Information Processing Letters"},{"key":"612_CR8","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. Information Processing Letters, 132, 39\u201343.","journal-title":"Information Processing Letters"},{"key":"612_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0020-0190(96)00021-X","volume":"57","author":"S Gawiejnowicz","year":"1996","unstructured":"Gawiejnowicz, S. (1996). A note on scheduling on a single processor with speed dependent on a number of executed jobs. Information Processing Letters, 57, 297\u2013300.","journal-title":"Information Processing Letters"},{"key":"612_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69446-5_5","volume-title":"Time-dependent scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S. (2008). Time-dependent scheduling. Berlin: Springer."},{"key":"612_CR11","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. Computers & Operations Research, 83, 150\u2013156.","journal-title":"Computers & Operations Research"},{"key":"612_CR12","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, 3164\u20133172.","journal-title":"International Journal of Production Research"},{"key":"612_CR13","volume-title":"International business: Competing in the global marketplace","author":"CWL Hill","year":"2016","unstructured":"Hill, C. W. L. (2016). International business: Competing in the global marketplace (6th ed.). New York: McGraw-Hill.","edition":"6"},{"key":"612_CR14","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. (2016). Minimizing maximum cost on a single machine with two competing agents and job rejection. Journal of the Operational Research Society, 67, 1524\u20131531.","journal-title":"Journal of the Operational Research Society"},{"key":"612_CR15","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. Annals of Operations Research, 271, 1079\u20131085.","journal-title":"Annals of Operations Research"},{"key":"612_CR16","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2018.1506540","author":"B Mor","year":"2018","unstructured":"Mor, B., & Shapira, D. (2018). Improved algorithms for scheduling on proportionate flowshop with job-rejection. Journal of the Operational Research Society. https:\/\/doi.org\/10.1080\/01605682.2018.1506540.","journal-title":"Journal of the Operational Research Society"},{"key":"612_CR600","doi-asserted-by":"publisher","DOI":"10.1080\/01605682.2019.1621222","author":"B Mor","year":"2019","unstructured":"Mor, B., Shapira, D. (2019). Scheduling with regular performance measures and optional job rejection on a single machine. Journal of the Operational Research Society.\nhttps:\/\/doi.org\/10.1080\/01605682.2019.1621222.","journal-title":"Journal of the Operational Research Society"},{"key":"612_CR17","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 132, 687\u2013693.","journal-title":"European Journal of Operational Research"},{"key":"612_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1002\/nav.21740","volume":"64","author":"G Mosheiov","year":"2017","unstructured":"Mosheiov, G., & Strusevich, V. (2017). Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow. Naval Research Logistics, 64, 217\u2013224.","journal-title":"Naval Research Logistics"},{"key":"612_CR19","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ipl.2016.02.008","volume":"116","author":"J Ou","year":"2016","unstructured":"Ou, J., Zhong, X., & Li, C. L. (2016). Faster algorithms for single machine scheduling with release dates and rejection. Information Processing Letters, 116, 503\u2013507.","journal-title":"Information Processing Letters"},{"key":"612_CR20","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","volume":"241","author":"J Ou","year":"2015","unstructured":"Ou, J., Zhong, X., & Wang, G. (2015). An improved heuristic for parallel machine scheduling with rejection. European Journal of Operational Research, 241, 653\u2013661.","journal-title":"European Journal of Operational Research"},{"key":"612_CR21","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, 3\u201328.","journal-title":"Journal of Scheduling"},{"key":"612_CR22","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s10951-014-0386-9","volume":"18","author":"D Shabtay","year":"2015","unstructured":"Shabtay, D., Karhi, S., & Oron, D. (2015). Multipurpose scheduling with rejection and job processing times. Journal of Scheduling, 18, 75\u201388.","journal-title":"Journal of Scheduling"},{"key":"612_CR23","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10951-014-0395-8","volume":"18","author":"S Thevenin","year":"2015","unstructured":"Thevenin, S., Zufferey, N., & Widmer, M. (2015). Metaheuristics for a scheduling problem with rejection and tardiness penalties. Journal of Scheduling, 18, 89\u2013105.","journal-title":"Journal of Scheduling"},{"key":"612_CR24","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"},{"key":"612_CR25","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. Journal of Combinatorial Optimization, 33, 934\u2013944.","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00612-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-019-00612-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-019-00612-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,25]],"date-time":"2020-11-25T07:45:08Z","timestamp":1606290308000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-019-00612-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,18]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["612"],"URL":"https:\/\/doi.org\/10.1007\/s10951-019-00612-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,7,18]]},"assertion":[{"value":"18 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}