{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:05:11Z","timestamp":1777597511889,"version":"3.51.4"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10288-012-0201-4","type":"journal-article","created":{"date-parts":[[2012,5,12]],"date-time":"2012-05-12T10:34:18Z","timestamp":1336818858000},"page":"347-360","source":"Crossref","is-referenced-by-count":16,"title":["Soft due window assignment and scheduling of unit-time jobs on parallel machines"],"prefix":"10.1007","volume":"10","author":[{"given":"Adam","family":"Janiak","sequence":"first","affiliation":[]},{"given":"Wladyslaw","family":"Janiak","sequence":"additional","affiliation":[]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[]},{"given":"Frank","family":"Werner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,13]]},"reference":[{"key":"201_CR1","unstructured":"Anger F, Lee CY, Martin-Vega L (1986) Single machine scheduling with tight windows. Department of Industrial and System Engineering, University of Florida, Gainsville, Res. Rep 86\u201316"},{"key":"201_CR2","doi-asserted-by":"crossref","first-page":"740","DOI":"10.1016\/j.ejor.2003.10.026","volume":"162","author":"D Biskup","year":"2005","unstructured":"Biskup D, Feldmann M (2005) On scheduling around large restrictive common due windows. Eur J Oper Res 162: 740\u2013761","journal-title":"Eur J Oper Res"},{"key":"201_CR3","first-page":"62","volume":"10","author":"L Bodin","year":"1983","unstructured":"Bodin L, Golden B, Assad A, Ball M (1983) Routing and scheduling of vehicles and crews: the state of the art. Comput Oper Res 10: 62\u2013212","journal-title":"Comput Oper Res"},{"key":"201_CR4","doi-asserted-by":"crossref","unstructured":"Burkard R, Cela E (1999) Linear assignment problems and extensions. In: Handbook of combinatorial optimization, Supplement vol A, Kluwer, Dordrecht, pp 75\u2013149","DOI":"10.1007\/978-1-4757-3023-4_2"},{"key":"201_CR5","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","volume":"15","author":"T Cheng","year":"1988","unstructured":"Cheng T (1988) Optimal common due-date with limited completion times deviation. Comput Oper Res 15: 91\u201396","journal-title":"Comput Oper Res"},{"key":"201_CR6","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/09537280110069621","volume":"13","author":"C Chu","year":"2002","unstructured":"Chu C, Gordon V, Proth JM (2002) Due date assignment and scheduling: SLK, TWK and other due date assignment models. Prod Plan Control 13: 117\u2013132","journal-title":"Prod Plan Control"},{"key":"201_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V Gordon","year":"2002","unstructured":"Gordon V, Proth JM, Chu C (2002) A survey of the state-of-the-art of common due date assignment and scheduling research. Eur J Oper Res 139: 1\u201325","journal-title":"Eur J Oper Res"},{"key":"201_CR8","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-010-0144-6","volume":"8","author":"H Hashimoto","year":"2010","unstructured":"Hashimoto H, Yagiura M, Imahori S, Ibaraki T (2010) Recent progress of local search in handling the time window constraints of the vehicle routing problem. 4OR 8: 221\u2013238","journal-title":"4OR"},{"key":"201_CR9","unstructured":"Janiak A, Winczaszek M (2003) An optimal algorithm for a single processor scheduling problem with a common due window. In: Proceedings of 9th IEEE international conference on methods and models in automation and robotics, Miedzyzdroje, Poland, 25\u201328 August 2003, pp 1213\u20131216"},{"key":"201_CR10","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/TSMCA.2007.893485","volume":"37","author":"A Janiak","year":"2007","unstructured":"Janiak A, Kovalyov M, Marek M (2007) Soft due window assignment and scheduling on parallel machines. IEEE Trans Syst Man Cybern Part A 37: 614\u2013620","journal-title":"IEEE Trans Syst Man Cybern Part A"},{"key":"201_CR11","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1016\/j.dam.2010.01.013","volume":"158","author":"I Kacem","year":"2010","unstructured":"Kacem I (2010) Fully polynomial time approximation scheme for the total weighted tardinessminimization with a common due date. Discret Appl Math 158: 1035\u20131040","journal-title":"Discret Appl Math"},{"key":"201_CR12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/opre.48.1.99.12447","volume":"48","author":"J Kanet","year":"2000","unstructured":"Kanet J, Sridharan V (2000) Scheduling with inserted idle time: problem taxonomy and literature review. Oper Res 48: 99\u2013110","journal-title":"Oper Res"},{"key":"201_CR13","doi-asserted-by":"crossref","unstructured":"Karakostas G, Kolliopoulos S, Wang J (2009) An fptas for the minimum total weightedtardiness problem with a fixed number of distinct due dates. In: Lecture notes in computer science, vol 5609. Springer, Berlin, pp 238\u2013248. doi: 10.1007\/978-3-642-02882-3_24","DOI":"10.1007\/978-3-642-02882-3_24"},{"key":"201_CR14","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/j.tcs.2006.08.030","volume":"369","author":"H Kellerer","year":"2006","unstructured":"Kellerer H, Strusevich V (2006) A fully polynomial approximation scheme for the singlemachine weighted total tardiness problem with a common due date. Theor Comput Sci 369: 230\u2013238","journal-title":"Theor Comput Sci"},{"key":"201_CR15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0895-7177(97)00074-5","volume":"25","author":"C Koulamas","year":"1997","unstructured":"Koulamas C (1997) Maximizing the weighted number of on-time jobs in a single-machine scheduling with time windows. Math Comput Model 25: 57\u201362","journal-title":"Math Comput Model"},{"key":"201_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0895-7177(94)90208-9","volume":"20","author":"FJ Kramer","year":"1994","unstructured":"Kramer FJ, Lee CY (1994) Due window scheduling for parallel machines. Math Comput Model 20: 69\u201389","journal-title":"Math Comput Model"},{"key":"201_CR17","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.ijpe.2009.07.006","volume":"123","author":"M Kritikos","year":"2010","unstructured":"Kritikos M, Ioannou G (2010) The balanced cargo vehicle routing problem with time windows. Int J Prod Econ 123: 42\u201351","journal-title":"Int J Prod Econ"},{"key":"201_CR18","unstructured":"Lee CY (1991) Earliness-tardiness scheduling problems with constant size of due window. Department of Industrial and System Engineering, University of Florida, Gainsville, Res. Rep. 91\u201317"},{"key":"201_CR19","doi-asserted-by":"crossref","first-page":"3612","DOI":"10.1016\/j.cor.2007.03.006","volume":"35","author":"CL Li","year":"2008","unstructured":"Li CL, Mosheiov G, Yovel U (2008) An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs. Comput Oper Res 35: 3612\u20133619","journal-title":"Comput Oper Res"},{"key":"201_CR20","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.ijpe.2010.01.013","volume":"125","author":"X Li","year":"2010","unstructured":"Li X, Tian P, Leung S (2010) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125: 137\u2013145","journal-title":"Int J Prod Econ"},{"key":"201_CR21","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10288-010-0136-6","volume":"9","author":"F Liberatore","year":"2011","unstructured":"Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR 9: 49\u201382","journal-title":"4OR"},{"key":"201_CR22","first-page":"107","volume":"39","author":"G Mosheiov","year":"2001","unstructured":"Mosheiov G (2001) A due-window determination in minmax scheduling problems. INFOR 39: 107\u2013123","journal-title":"INFOR"},{"key":"201_CR23","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1002\/nav.20039","volume":"51","author":"G Mosheiov","year":"2004","unstructured":"Mosheiov G, Oron D (2004) Due-window assignment with unit processing-time jobs. Naval Res Logist 51: 1005\u20131017","journal-title":"Naval Res Logist"},{"key":"201_CR24","doi-asserted-by":"crossref","first-page":"1492","DOI":"10.1016\/j.ins.2009.11.042","volume":"180","author":"G Mosheiov","year":"2010","unstructured":"Mosheiov G, Sarig A (2010) Scheduling with a common due-window: polynomially solvable cases. Inf Sci 180: 1492\u20131505","journal-title":"Inf Sci"},{"key":"201_CR25","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1002\/net.3230110212","volume":"11","author":"L Schrage","year":"1981","unstructured":"Schrage L (1981) Formulation and structure of more complex\/realistic routing and scheduling problems. Networks 11: 229\u2013232","journal-title":"Networks"},{"key":"201_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M Solomon","year":"1988","unstructured":"Solomon M, Desrosiers J (1988) Time window constrained routing and scheduling problems. Transp Sci 22: 1\u201313","journal-title":"Transp Sci"},{"key":"201_CR27","volume-title":"Lecture notes in computer science, vol 350","author":"A Torn","year":"1989","unstructured":"Torn A, Zilinskas A (1989) Global optimization. In: (eds) Lecture notes in computer science, vol 350. Springer, Heidelberg"},{"key":"201_CR28","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.ejor.2009.06.033","volume":"202","author":"NH Tuong","year":"2010","unstructured":"Tuong NH, Soukhal A, Billaut JC (2010) A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines. Eur J Oper Res 202: 646\u2013653","journal-title":"Eur J Oper Res"},{"key":"201_CR29","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1109\/5326.704596","volume":"28","author":"D Wang","year":"1998","unstructured":"Wang D, Fang S, Hodgson T (1998) A fuzzy due-date bargainer for the make-to-order manufacturing systems. IEEE Trans Syst Man Cybern Part C 28: 492\u2013497","journal-title":"IEEE Trans Syst Man Cybern Part C"},{"key":"201_CR30","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1109\/5326.798770","volume":"29","author":"D Wang","year":"1999","unstructured":"Wang D, Fang S, Nuttle H (1999) Soft computing for multicustomer due-date bargaining. IEEE Trans Syst Man Cybern Part C 29: 566\u2013575","journal-title":"IEEE Trans Syst Man Cybern Part C"},{"key":"201_CR31","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/j.ijpe.2009.09.006","volume":"124","author":"C Wen","year":"2010","unstructured":"Wen C, Eksioglu S, Greenwood A, Zhang S (2010) Crane scheduling in a shipbuilding environment. Int J Prod Econ 124: 40\u201350","journal-title":"Int J Prod Econ"},{"key":"201_CR32","first-page":"222","volume":"10","author":"B Yen","year":"1999","unstructured":"Yen B, Wan G (1999) Single machine bicriteria scheduling: a survey. Int J Ind Eng Theory 10: 222\u2013231","journal-title":"Int J Ind Eng Theory"},{"key":"201_CR33","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/S0925-5273(03)00044-6","volume":"90","author":"W Yeung","year":"2004","unstructured":"Yeung W, Oguz C, Cheng T (2004) Two-stage flowshop earliness and tardiness machine scheduling involving a common due window. Int J Prod Econ 90: 421\u2013434","journal-title":"Int J Prod Econ"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10288-012-0201-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T18:40:02Z","timestamp":1497984002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-012-0201-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,13]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s10288-012-0201-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,13]]}}}