{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:23Z","timestamp":1759847543867},"reference-count":13,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,6,1]],"date-time":"1996-06-01T00:00:00Z","timestamp":833587200000},"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":6255,"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":[[1996,6]]},"DOI":"10.1016\/0166-218x(95)00055-v","type":"journal-article","created":{"date-parts":[[2003,4,30]],"date-time":"2003-04-30T22:23:46Z","timestamp":1051741426000},"page":"169-188","source":"Crossref","is-referenced-by-count":15,"title":["Restrictions and preassignments in preemptive open shop scheduling"],"prefix":"10.1016","volume":"68","author":[{"given":"D.","family":"De Werra","sequence":"first","affiliation":[]},{"given":"A.J.","family":"Hoffman","sequence":"additional","affiliation":[]},{"given":"N.V.R.","family":"Mahadev","sequence":"additional","affiliation":[]},{"given":"U.N.","family":"Peled","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00055-V_BIB1","series-title":"Graphes","author":"Berge","year":"1983"},{"key":"10.1016\/0166-218X(95)00055-V_BIB2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01584535","article-title":"Balanced Matrices","volume":"2","author":"Berge","year":"1972","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(95)00055-V_BIB3","series-title":"Scheduling in Computer and Manufacturing Systems","author":"Blazewicz","year":"1983"},{"key":"10.1016\/0166-218X(95)00055-V_BIB4","series-title":"Scheduling Resource Contraints: Deterministic Models","author":"Blazewicz","year":"1986"},{"key":"10.1016\/0166-218X(95)00055-V_BIB5","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0406048","article-title":"Edge-chromatic scheduling with simultaneity constraints","author":"de Werra","year":"1993","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/0166-218X(95)00055-V_BIB6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1137\/0205048","article-title":"On the complexity of timetable and multicommodity flow problems","volume":"5","author":"Even","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00055-V_BIB7","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/BFb0121244","article-title":"On balanced matrices","volume":"1","author":"Fulkerson","year":"1974","journal-title":"Math. Progr. Study"},{"key":"10.1016\/0166-218X(95)00055-V_BIB8","article-title":"Feasible Graph Coloring and a Generalization of Perfect Graphs","author":"Groeflin","year":"1992"},{"key":"10.1016\/0166-218X(95)00055-V_BIB9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","article-title":"The Ellipsoid method and its consequences in Combinatorial Optimization","volume":"1","author":"Groetschel","year":"1981","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(95)00055-V_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","article-title":"An n52 algorithm for maximum matching in bipartite graphs","volume":"2","author":"Hopcroft","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(95)00055-V_BIB11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(92)90202-L","article-title":"Some results concerning the complexity of restricted colorings of graphs","volume":"36","author":"Kubale","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(95)00055-V_BIB12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0012-365X(93)90546-6","article-title":"Interval edge coloring of a graph with forbidden colors","volume":"121","author":"Kubale","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00055-V_BIB13","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1090\/S0002-9947-1932-1501641-2","article-title":"Non-separable and planar graphs","volume":"34","author":"Whitney","year":"1932","journal-title":"Trans. Amer. Math. Soc."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500055V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500055V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:29:55Z","timestamp":1555982995000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500055V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,6]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,6]]}},"alternative-id":["0166218X9500055V"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00055-v","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,6]]}}}