{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:22:10Z","timestamp":1770510130204,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T00:00:00Z","timestamp":1517529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["grant No. 1286\/14"],"award-info":[{"award-number":["grant No. 1286\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1007\/s10479-018-2779-1","type":"journal-article","created":{"date-parts":[[2018,2,2]],"date-time":"2018-02-02T09:38:31Z","timestamp":1517564311000},"page":"1079-1085","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection"],"prefix":"10.1007","volume":"271","author":[{"given":"Baruch","family":"Mor","sequence":"first","affiliation":[]},{"given":"Gur","family":"Mosheiov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,2,2]]},"reference":[{"key":"2779_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41880-8","volume-title":"Multiagent scheduling: Models and algorithms","author":"A Agnetis","year":"2014","unstructured":"Agnetis, A., Billaut, J.-C., Gawiejnowicz, S., Pacciarelli, D., & Soukhal, A. (2014). Multiagent scheduling: Models and algorithms. Berlin: Springer."},{"key":"2779_CR2","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":"2779_CR3","doi-asserted-by":"publisher","first-page":"5717","DOI":"10.1080\/00207543.2014.991843","volume":"53","author":"Y Ben-Yehoshua","year":"2015","unstructured":"Ben-Yehoshua, Y., Hariri, E., & Mosheiov, G. (2015). A note on minimising total absolute deviation of job completion times on a two-machine no-wait proportionate flowshop. International Journal of Production Research, 53, 5717\u20135724.","journal-title":"International Journal of Production Research"},{"key":"2779_CR4","doi-asserted-by":"crossref","unstructured":"Chen, S. H., Mani, V., & Chen, Y. H. (2015). Bi-criterion single machine scheduling problem with a past-sequence-dependent setup times and learning effect. In Proceedings of the 2015 IEEE IEEM (pp. 185\u2013189).","DOI":"10.1109\/IEEM.2015.7385633"},{"key":"2779_CR5","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, Heidelberg: Springer."},{"key":"2779_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. Computers and Operations Research, 83, 150\u2013156.","journal-title":"Computers and Operations Research"},{"key":"2779_CR7","first-page":"3164","volume":"55","author":"E Gerstl","year":"2017","unstructured":"Gerstl, E., & Mosheiov, G. (2017). Single machine scheduling problems with generalized due-dates and job-rejection. International Journal of Operations Research, 55, 3164\u20133172.","journal-title":"International Journal of Operations Research"},{"key":"2779_CR8","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.apm.2010.09.013","volume":"35","author":"X Huang","year":"2011","unstructured":"Huang, X., & Wang, M. Z. (2011). Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties. Applied Mathematical Modeling, 35, 1349\u20131353.","journal-title":"Applied Mathematical Modeling"},{"key":"2779_CR9","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1016\/j.ipl.2010.04.015","volume":"110","author":"M Ji","year":"2010","unstructured":"Ji, M., & Cheng, T. C. E. (2010). Scheduling with job-dependent learning effects and multiple rate-modifying activities. Information Processing Letters, 110, 460\u2013463.","journal-title":"Information Processing Letters"},{"key":"2779_CR10","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/mnsc.27.12.1453","volume":"27","author":"J Kanet","year":"1981","unstructured":"Kanet, J. (1981). Minimizing variation of flow time in single machine systems. Management Science, 27, 1453\u20131459.","journal-title":"Management Science"},{"key":"2779_CR11","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1016\/j.ejor.2006.03.066","volume":"187","author":"C Koulamas","year":"2008","unstructured":"Koulamas, C., & Kyparisis, G. J. (2008). Single machine scheduling problems with past-sequence-dependent setup times. European Journal of Operational Research, 187, 1045\u20131049.","journal-title":"European Journal of Operational Research"},{"key":"2779_CR12","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1016\/j.ijpe.2008.11.011","volume":"118","author":"Y Li","year":"2009","unstructured":"Li, Y., Li, G., Sun, L., & Xu, Z. (2009). Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times. International Journal of Production Economics, 118, 424\u2013429.","journal-title":"International Journal of Production Economics"},{"key":"2779_CR13","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1080\/00207721003718436","volume":"42","author":"V Mani","year":"2011","unstructured":"Mani, V., Chang, P. C., & Chen, S. H. (2011). Single-machine scheduling with past-sequence-dependent setup times and learning effects: A parametric analysis. International Journal of Systems Science, 42, 2097\u20132102.","journal-title":"International Journal of Systems Science"},{"key":"2779_CR14","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.cor.2010.08.005","volume":"38","author":"B Mor","year":"2011","unstructured":"Mor, B., & Mosheiov, G. (2011). Total absolute deviation of job completion times on uniform and unrelated machines. Computers and Operations Research, 38, 660\u2013665.","journal-title":"Computers and Operations Research"},{"key":"2779_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. (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":"2779_CR16","doi-asserted-by":"publisher","first-page":"1422","DOI":"10.1057\/palgrave.jors.2602480","volume":"59","author":"G Mosheiov","year":"2008","unstructured":"Mosheiov, G. (2008). Minimizing total absolute deviation of job completion times: Extensions to position-dependent processing times and parallel identical machines. Journal of the Operational Research Society, 59, 1422\u20131424.","journal-title":"Journal of the Operational Research Society"},{"key":"2779_CR17","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":"2779_CR18","doi-asserted-by":"publisher","first-page":"2071","DOI":"10.1016\/j.cor.2006.10.010","volume":"35","author":"D Oron","year":"2008","unstructured":"Oron, D. (2008). Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times. Computers and Operations Research, 35, 2071\u20132078.","journal-title":"Computers and Operations Research"},{"key":"2779_CR19","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":"2779_CR20","doi-asserted-by":"publisher","unstructured":"Pei, J., Cheng, B., Liu, X., Pardalos, P. M., & Kong, M. (2017). Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Annals of Operations Research. \n                    https:\/\/doi.org\/10.1007\/s10479-017-2481-8\n                    \n                  .","DOI":"10.1007\/s10479-017-2481-8"},{"key":"2779_CR21","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10479-012-1098-1","volume":"196","author":"R Rudek","year":"2012","unstructured":"Rudek, R. (2012). Scheduling problems with position dependent job processing times: Computational complexity results. Annals of Operations Research, 196, 491\u2013516.","journal-title":"Annals of Operations Research"},{"key":"2779_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, 3\u201328.","journal-title":"Journal of Scheduling"},{"key":"2779_CR23","volume-title":"Elementary probability","author":"D Stirzaker","year":"1994","unstructured":"Stirzaker, D. (1994). Elementary probability. Cambridge: Cambridge University Press."},{"key":"2779_CR24","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10479-013-1481-6","volume":"211","author":"L-H Sun","year":"2013","unstructured":"Sun, L.-H., Cui, K., Chen, J.-H., Wang, J., & He, X.-C. (2013). Research on permutation flow shop scheduling problems with general position-dependent learning effects. Annals of Operations Research, 211, 473\u2013480.","journal-title":"Annals of Operations Research"},{"key":"2779_CR25","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":"2779_CR26","doi-asserted-by":"publisher","first-page":"3691","DOI":"10.1080\/00207543.2015.1136081","volume":"54","author":"DJ Wang","year":"2016","unstructured":"Wang, D. J., Yin, Y., & Liu, M. (2016). Bicriteria scheduling problems involving job rejection, controllable processing times and rate-modifying activity. International Journal of Production Research, 54, 3691\u20133705.","journal-title":"International Journal of Production Research"},{"key":"2779_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10479-009-0615-3","volume":"172","author":"DL Yang","year":"2009","unstructured":"Yang, D. L., & Kuo, W. H. (2009). Single machine scheduling with both deterioration and learning effects. Annals of OR, 172, 315\u2013327.","journal-title":"Annals of OR"},{"key":"2779_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.cie.2009.06.016","volume":"58","author":"DL Yang","year":"2010","unstructured":"Yang, D. L., & Kuo, W. H. (2010). Some scheduling problems with deteriorating jobs and learning effects. Computers & Industrial Engineering, 58, 25\u201328.","journal-title":"Computers & Industrial Engineering"},{"key":"2779_CR29","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":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-2779-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2779-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2779-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T20:44:12Z","timestamp":1549053852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-2779-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,2,2]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["2779"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-2779-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,2,2]]},"assertion":[{"value":"2 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}