{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T02:16:47Z","timestamp":1769307407715,"version":"3.49.0"},"reference-count":25,"publisher":"EDP Sciences","issue":"3","license":[{"start":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T00:00:00Z","timestamp":1624320000000},"content-version":"vor","delay-in-days":52,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["71832001"],"award-info":[{"award-number":["71832001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Science Foundation of China","doi-asserted-by":"crossref","award":["71771048"],"award-info":[{"award-number":["71771048"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"accepted":{"date-parts":[[2021,5,9]]},"published-print":{"date-parts":[[2021,5]]},"abstract":"<jats:p>We study multitasking scheduling and due-window assignment problems in a single machine, which can be found in various application domains. In multitasking environment, unfinished job always interrupts in-processing job. In common due window assignment, the aim is to find optimal due window to minimise the value of the earliness and tardiness penalty. In this paper, we study two problems, where the objective of the first problem is minimise the earliness, tardiness, due-window starting time, and due-window size costs, the objective of the second problem is minmax common due-date with completion time penalty, then we obtain some analytical properties and provide polynomial time solutions. Finally, the experimental results show that the proposed methods are effective.<\/jats:p>","DOI":"10.1051\/ro\/2021079","type":"journal-article","created":{"date-parts":[[2021,5,12]],"date-time":"2021-05-12T19:00:59Z","timestamp":1620846059000},"page":"1787-1798","source":"Crossref","is-referenced-by-count":8,"title":["Multitasking scheduling problems with a common due-window"],"prefix":"10.1051","volume":"55","author":[{"given":"Chen","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinfeng","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feifeng","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2021,6,22]]},"reference":[{"key":"R1","unstructured":"Brucker P., Scheduling Algorithms. Springer, Berlin (2007)."},{"key":"R2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ejor.2012.12.034","volume":"229","author":"Gerstl","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"R3","doi-asserted-by":"crossref","first-page":"1248","DOI":"10.1111\/poms.12331","volume":"24","author":"Hall","year":"2015","journal-title":"Prod. Oper. Manag."},{"key":"R4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.dam.2016.03.018","volume":"208","author":"Hall","year":"2016","journal-title":"Discret. Appl. Math."},{"key":"R5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.ins.2012.10.024","volume":"224","author":"Janiak","year":"2013","journal-title":"Inf. Sci."},{"key":"R6","doi-asserted-by":"crossref","first-page":"1244","DOI":"10.1080\/00207543.2015.1058538","volume":"54","author":"Ji","year":"2016","journal-title":"Int. J. Pro. Res."},{"key":"R7","unstructured":"Ji M., Liao L.J., Zhang W.Y., Cheng T.C.E. and Tan Y.Y., Multitasking Scheduling with General Aging Effect. Multiple Rate-Modifying Activities and Past-sequence-dependent Delivery Times. Working Paper (2018)."},{"key":"R8","doi-asserted-by":"crossref","first-page":"1940","DOI":"10.1080\/0305215X.2019.1678609","volume":"52","author":"Li","year":"2019","journal-title":"Eng. Optimiz."},{"key":"R9","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","volume":"93","author":"Liman","year":"1998","journal-title":"J. Oper. Res. Soc."},{"key":"R10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207543.2015.1114186","volume":"54","author":"Liu","year":"2016","journal-title":"Int. J. Prod. Res."},{"key":"R11","doi-asserted-by":"crossref","first-page":"6052","DOI":"10.1080\/00207543.2017.1321804","volume":"55","author":"Liu","year":"2017","journal-title":"Int. J. Prod. Res."},{"key":"R12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jmsy.2017.01.002","volume":"43","author":"Liu","year":"2017","journal-title":"J. Manuf. Syst."},{"key":"R13","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1002\/nav.20039","volume":"51","author":"Mosheiov","year":"2004","journal-title":"Nav. Res. Logist."},{"key":"R14","unstructured":"Papadimitriou C.H. and Steiglitz K., Combinatorial Optimization: Algorithms and Complexity. Englewood Cliffs, NJ, Prentice Hall (1982)."},{"key":"R15","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1108\/00220410410548126","volume":"60","author":"Spink","year":"2004","journal-title":"J. Doc."},{"key":"R16","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1002\/asi.10124","volume":"53","author":"Spink","year":"2014","journal-title":"J. Am. Soc. Inform. Sci. Tech."},{"key":"R17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/00207543.2019.1693649","volume":"59","author":"Wang","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"R18","doi-asserted-by":"crossref","first-page":"106569","DOI":"10.1016\/j.cie.2020.106569","volume":"146","author":"Wang","year":"2020","journal-title":"Comput. Ind. Eng."},{"key":"R19","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1002\/nav.21863","volume":"66","author":"Xiong","year":"2019","journal-title":"Nav. Res. Logist."},{"key":"R20","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/j.ijpe.2013.12.021","volume":"150","author":"Yang","year":"2014","journal-title":"Int. J. Prod. Econ."},{"key":"R21","doi-asserted-by":"crossref","unstructured":"Yang Y., Yin G., Wang C. and Yin Y., Due date assignment and two-agent scheduling under multitasking environment. J. Comb. Optim. 2 (2020).","DOI":"10.1007\/s10878-020-00600-5"},{"key":"R22","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/j.omega.2012.06.002","volume":"41","author":"Yin","year":"2013","journal-title":"Omega"},{"key":"R23","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.cie.2013.05.003","volume":"65","author":"Yin","year":"2013","journal-title":"Comp. Ind. Eng."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Zhu Z., Zheng F., Chu C., Multitasking scheduling problems with a rate-modifying activity. Int. J. Prod. Res. (2016) 1\u201317.","DOI":"10.1080\/00207543.2016.1208852"},{"key":"R25","unstructured":"Zhu Z.G., Liu M., Chu C.B. and Li J.L., Multitasking scheduling with multiple rate-modifying activities. Int. Trans. Oper. Res. (2017) 1\u201321."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021079\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,22]],"date-time":"2021-06-22T08:54:21Z","timestamp":1624352061000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.rairo-ro.org\/10.1051\/ro\/2021079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":25,"journal-issue":{"issue":"3"},"alternative-id":["ro200283"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2021079","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]}}}