{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T17:00:03Z","timestamp":1776790803258,"version":"3.51.2"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1016\/s0377-2217(02)00759-2","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T17:32:55Z","timestamp":1053365575000},"page":"344-354","source":"Crossref","is-referenced-by-count":6,"title":["On minimizing the weighted number of late jobs in unit execution time open-shops"],"prefix":"10.1016","volume":"149","author":[{"given":"Philippe","family":"Baptiste","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00759-2_BIB1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1002\/(SICI)1099-1425(199911\/12)2:6<245::AID-JOS28>3.0.CO;2-5","article-title":"Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine when processing times are equal","volume":"2","author":"Baptiste","year":"1999","journal-title":"Journal of Scheduling"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/S0166-218X(99)00238-3","article-title":"Scheduling equal-length jobs on identical parallel machines","volume":"103","author":"Baptiste","year":"2000","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB3","first-page":"59","article-title":"Open shop problems with unit time operations","volume":"37","author":"Brucker","year":"1993","journal-title":"Zeitschrift f\u00fcr Operations Research"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB4","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0167-6377(93)90088-X","article-title":"Scheduling unit time open shops to minimize the weighted number of late jobs","volume":"14","author":"Brucker","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB5","series-title":"Scheduling Algorithms","author":"Brucker","year":"1995"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB6","first-page":"219","article-title":"Probl\u00e8me \u00e0 une machine et algorithmes polyn\u00f4miaux","volume":"5","author":"Carlier","year":"1981","journal-title":"QUESTIO"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB7","unstructured":"J. Carlier, Probl\u00e8mes d\u2019ordonnancements \u00e0 contraintes de Ressources: Algorithmes et Complexit\u00e9, Th\u00e8se d\u2019Etat, Universit\u00e9 Paris VI, 1984"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB8","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1111\/j.1467-9574.1990.tb01276.x","article-title":"Scheduling identical jobs on uniform parallel machines","volume":"44","author":"Dessouky","year":"1990","journal-title":"Statistica Neerlandica"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01415068","article-title":"Minimizing the weighted number of late jobs in UET open shops","volume":"41","author":"Galambos","year":"1995","journal-title":"Zeitschrift f\u00fcr Operations Research ZOR\u2013\u2013Mathematical Methods of Operations Research"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB10","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1137\/0210018","article-title":"Scheduling unit-time tasks with arbitrary release times and deadlines","volume":"10","author":"Garey","year":"1981","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB11","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(97)81448-5","article-title":"On the complexity of minimizing weighted number of late jobs in unit time open shops","volume":"74","author":"Gladky","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/moor.7.1.57","article-title":"Unit execution time shop problems","volume":"7","author":"Gonzalez","year":"1982","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB13","unstructured":"S. Knust, Complexity results for scheduling problems, www\/\/mathematik.uni-osnabrueck.de\/research\/OR\/class"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB14","unstructured":"S.A. Kravchenko, On the complexity of minimizing the number of late jobs in unit time open shop, Discrete Applied Mathematics, submitted for publication"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB15","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1080\/03155986.1991.11732176","article-title":"A note on the complexity of openshop scheduling problems","volume":"29","author":"Kubiak","year":"1991","journal-title":"Information Systems and Operational Research"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB16","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1287\/opre.36.4.553","article-title":"Scheduling open shops with unit execution times to minimize functions of due dates","volume":"36","author":"Liu","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0212018","article-title":"Multiprocessor scheduling of unit-time jobs with arbitrary release times and deadlines","volume":"12","author":"Simons","year":"1983","journal-title":"SIAM Journal of Computing"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/S0166-218X(98)00032-8","article-title":"Is a unit-time job shop not easier than identical parallel machines","volume":"85","author":"Timkovsky","year":"1998","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(02)00759-2_BIB19","unstructured":"V.G. Timkovsky, Identical parallel machines vs. unit-time shops, preemptions vs. chains, and other offsets in scheduling complexity, Technical report, Star Data Systems Inc, 1998"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007592?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702007592?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T03:58:54Z","timestamp":1553918334000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702007592"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["S0377221702007592"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00759-2","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}