{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:36:24Z","timestamp":1773326184998,"version":"3.50.1"},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1992,11,1]],"date-time":"1992-11-01T00:00:00Z","timestamp":720576000000},"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":7563,"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":[[1992,11]]},"DOI":"10.1016\/0166-218x(92)90176-b","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"197-205","source":"Crossref","is-referenced-by-count":17,"title":["Openshop scheduling with machine dependent processing times"],"prefix":"10.1016","volume":"39","author":[{"given":"Moshe","family":"Dror","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90176-B_BIB1","doi-asserted-by":"crossref","first-page":"709","DOI":"10.1137\/0211058","article-title":"Scheduling the openshop to minimize mean flow time","author":"Achugbue","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(92)90176-B_BIB2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1002\/nav.3220360305","article-title":"Openshop scheduling problems with dominated machines","volume":"36","author":"Adiri","year":"1989","journal-title":"Naval Res. Logist."},{"key":"10.1016\/0166-218X(92)90176-B_BIB3","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0305-0548(84)90016-9","article-title":"Openshop and flowshop scheduling to minimize sum of completion times","volume":"11","author":"Adiri","year":"1984","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/0166-218X(92)90176-B_BIB4","series-title":"Mimeograph Series No. 260","article-title":"Subproblems of openshop\u2014more than two machines\u2014schedule length problems","author":"Adiri","year":"1980"},{"key":"10.1016\/0166-218X(92)90176-B_BIB5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1080\/09511928908944401","article-title":"Group technology for difficult groups by scheduling measures","volume":"2","author":"Ben-Arieh","year":"1989","journal-title":"Internat. J. Comput. Integrated Manufact."},{"key":"10.1016\/0166-218X(92)90176-B_BIB6","first-page":"1","article-title":"Selected topics in scheduling theory","volume":"31","author":"Blazewicz","year":"1987"},{"key":"10.1016\/0166-218X(92)90176-B_BIB7","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(92)90176-B_BIB8","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","article-title":"Openshop scheduling to minimize finish time","volume":"23","author":"Gonzalez","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(92)90176-B_BIB9","first-page":"287","article-title":"Optimization and approximation in deterministic sequencing and scheduling: a survey","volume":"5","author":"Graham","year":"1979"},{"key":"10.1016\/0166-218X(92)90176-B_BIB10","article-title":"Openshop scheduling: A survey","author":"Kubiak","year":"1989","journal-title":"GERAD-G-89-19"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290176B?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290176B?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:51:12Z","timestamp":1555131072000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290176B"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,11]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1992,11]]}},"alternative-id":["0166218X9290176B"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90176-b","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,11]]}}}