{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T18:10:26Z","timestamp":1738260626981,"version":"3.35.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2009,6]]},"DOI":"10.1016\/j.cor.2008.06.001","type":"journal-article","created":{"date-parts":[[2008,6,11]],"date-time":"2008-06-11T10:04:41Z","timestamp":1213178681000},"page":"1886-1892","source":"Crossref","is-referenced-by-count":22,"title":["Minmax scheduling problems with a common due-window"],"prefix":"10.1016","volume":"36","author":[{"given":"Gur","family":"Mosheiov","sequence":"first","affiliation":[]},{"given":"Assaf","family":"Sarig","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.cor.2008.06.001_bib1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","article-title":"A survey of the state of the art of common due date assignment and scheduling research","volume":"139","author":"Gordon","year":"2002","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.cor.2008.06.001_bib2","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","article-title":"Common due window size and location determination in a single machine scheduling problem","volume":"49","author":"Liman","year":"1998","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/j.cor.2008.06.001_bib3","first-page":"107","article-title":"A due-window determination in minmax scheduling problems","volume":"39","author":"Mosheiov","year":"2001","journal-title":"INFOR"},{"doi-asserted-by":"crossref","unstructured":"Janiak A, Winczaszek M. A single processor scheduling problem with a common due window assignment. In: Fleuren H, den Hertog D, Kort P, editors. Operations research proceedings; 2004. p. 213\u201320.","key":"10.1016\/j.cor.2008.06.001_bib4","DOI":"10.1007\/3-540-27679-3_27"},{"key":"10.1016\/j.cor.2008.06.001_bib5","series-title":"Operations research proceedings","first-page":"207","article-title":"Multi-machine scheduling problem with due interval assignment subject to generalized sum type criterion","author":"Janiak","year":"2002"},{"doi-asserted-by":"crossref","unstructured":"Janiak A, Marek M. Parallel processor scheduling problem with optimal due interval assignment. In: Proceedings of third international conference on parallel computing systems; 2004. p. 383\u20137.","key":"10.1016\/j.cor.2008.06.001_bib6","DOI":"10.1109\/ENC.2004.1342631"},{"key":"10.1016\/j.cor.2008.06.001_bib7","doi-asserted-by":"crossref","first-page":"1005","DOI":"10.1002\/nav.20039","article-title":"Due-window assignment with unit processing-time jobs","volume":"51","author":"Mosheiov","year":"2004","journal-title":"Naval Research Logistics"},{"key":"10.1016\/j.cor.2008.06.001_bib8","first-page":"132","article-title":"Common due window assignment in parallel processor scheduling problem with nonlinear penalty functions","volume":"vol. 3911","author":"Janiak","year":"2006"},{"key":"10.1016\/j.cor.2008.06.001_bib9","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/TSMCA.2007.893485","article-title":"Soft due window assignment and scheduling on parallel machines","volume":"Part A 37","author":"Janiak","year":"2007","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"10.1016\/j.cor.2008.06.001_bib10","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0305-0548(02)00225-3","article-title":"A note on a due-date assignment problem on a two-machine flow-shop","volume":"31","author":"Birman","year":"2004","journal-title":"Computers & Operations Research"},{"year":"1995","author":"Pinedo","series-title":"Scheduling: theory, algorithms and systems","key":"10.1016\/j.cor.2008.06.001_bib11"},{"year":"1979","author":"Garey","series-title":"Computers and intractability\u2014a guide to the theory of NP-completeness","key":"10.1016\/j.cor.2008.06.001_bib12"},{"key":"10.1016\/j.cor.2008.06.001_bib13","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1137\/0209007","article-title":"Bounds for list schedules on uniform machines","volume":"9","author":"Cho","year":"1980","journal-title":"SIAM Journal on Computing"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054808001111?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054808001111?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,1,30]],"date-time":"2025-01-30T17:33:55Z","timestamp":1738258435000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054808001111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["S0305054808001111"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2008.06.001","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}