{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T00:44:39Z","timestamp":1648687479847},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1997,4,1]],"date-time":"1997-04-01T00:00:00Z","timestamp":859852800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5951,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1997,4]]},"DOI":"10.1016\/s0166-218x(97)81448-5","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"197-201","source":"Crossref","is-referenced-by-count":3,"title":["On complexity of minimizing weighted number of late jobs in unit time open shops"],"prefix":"10.1016","volume":"74","author":[{"given":"A.A.","family":"Gladky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)81448-5_BIB1","first-page":"59","article-title":"Open shop problems with unit time operations","volume":"37","author":"Brucker","year":"1993","journal-title":"Z. Oper. Res."},{"key":"10.1016\/S0166-218X(97)81448-5_BIB2","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":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(97)81448-5_BIB3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(97)81448-5_BIB4","first-page":"284","article-title":"A note on the complexity of open-shop scheduling problems","volume":"29","author":"Kubiak","year":"1991","journal-title":"INFOR"},{"key":"10.1016\/S0166-218X(97)81448-5_BIB5","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":"1985","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(97)81448-5_BIB6","article-title":"Open-shop-Probleme mit Einheitsbearbeitungszeiten","author":"Tautenhahn","year":"1993","journal-title":"Thesis"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97814485?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97814485?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:28:36Z","timestamp":1556116116000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97814485"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,4]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,4]]}},"alternative-id":["S0166218X97814485"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)81448-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,4]]}}}