{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T06:39:18Z","timestamp":1759991958704},"reference-count":10,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":6041,"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,1]]},"DOI":"10.1016\/s0166-218x(96)00042-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:19:33Z","timestamp":1049721573000},"page":"155-166","source":"Crossref","is-referenced-by-count":43,"title":["Scheduling with forbidden sets"],"prefix":"10.1016","volume":"72","author":[{"given":"Markus W.","family":"Sch\u00e4ffter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(96)00042-X_BIB1","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02283745","article-title":"Scheduling project networks with resource constraints and time windows","volume":"16","author":"Bartusch","year":"1988","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/S0166-218X(96)00042-X_BIB2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0167-9236(89)90013-4","article-title":"A conceptional outline of a DSS for scheduling problems in the building industry","volume":"5","author":"Bartusch","year":"1989","journal-title":"Decision Support Systems"},{"key":"10.1016\/S0166-218X(96)00042-X_BIB3","series-title":"Graph Theory, An Introductory Course","author":"Bollob\u00e1s","year":"1979"},{"key":"10.1016\/S0166-218X(96)00042-X_BIB4","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(96)00042-X_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some Simplified NP-Complete Graph Problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/S0166-218X(96)00042-X_BIB6","doi-asserted-by":"crossref","first-page":"1563","DOI":"10.1002\/j.1538-7305.1966.tb01709.x","article-title":"Bounds for certain multiprocessing anomalies","volume":"45","author":"Graham","year":"1986","journal-title":"Bell System Technical J."},{"key":"10.1016\/S0166-218X(96)00042-X_BIB7","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(96)00042-X_BIB8","series-title":"Graphen, Netzwerke und Algorithmen [German]","author":"Jungnickel","year":"1990"},{"key":"10.1016\/S0166-218X(96)00042-X_BIB9","series-title":"Proc. 4th Southeastern Conference on Combinatorics, Graph Theory, and Computing","first-page":"3","article-title":"Covering and coloring of hypergraphs","author":"Lov\u00e1sz","year":"1973"},{"key":"10.1016\/S0166-218X(96)00042-X_BIB10","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1002\/nav.3800330414","article-title":"Rescheduling to minimize makespan on a changing number of identical processors","volume":"33","author":"Tovey","year":"1986","journal-title":"Naval Res. Logist. Quat."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600042X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X9600042X?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:27:59Z","timestamp":1556116079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X9600042X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0166218X9600042X"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(96)00042-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}