乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T22:26:49Z","timestamp":1699914409562},"reference-count":21,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1016\/j.orl.2004.11.009","type":"journal-article","created":{"date-parts":[[2005,1,19]],"date-time":"2005-01-19T12:29:53Z","timestamp":1106137793000},"page":"587-596","source":"Crossref","is-referenced-by-count":13,"title":["On the complexity of scheduling unit-time jobs with OR-precedence constraints"],"prefix":"10.1016","volume":"33","author":[{"given":"Berit","family":"Johannes","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.11.009_bib1","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1137\/0606066","article-title":"Profile scheduling of opposing forests and level orders","volume":"6","author":"Dolev","year":"1985","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/j.orl.2004.11.009_bib2","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1145\/321958.321967","article-title":"Scheduling tasks with nonuniform deadlines on two processors","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/j.orl.2004.11.009_bib3","series-title":"Computers and Intractibility","author":"Garey","year":"1979"},{"key":"10.1016\/j.orl.2004.11.009_bib4","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":"Theoret. Comput. Sci."},{"key":"10.1016\/j.orl.2004.11.009_bib5","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1137\/0604011","article-title":"Scheduling opposing forests","volume":"4","author":"Garey","year":"1983","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/j.orl.2004.11.009_bib6","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1137\/S0097539791218664","article-title":"Scheduling tasks with AND\/OR precedence constraints","volume":"24","author":"Gillies","year":"1995","journal-title":"SIAM J. Computing"},{"key":"10.1016\/j.orl.2004.11.009_bib7","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1142\/S0218195999000248","article-title":"Complexity measures for assembly sequences","volume":"9","author":"Goldwasser","year":"1999","journal-title":"Internat. J. Comput. Geometry Appl."},{"key":"10.1016\/j.orl.2004.11.009_bib8","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/j.orl.2004.11.009_bib9","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","volume":"5","author":"Graham","year":"1979","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.orl.2004.11.009_bib10","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2004.11.009_bib11","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/net.3230130103","article-title":"Algorithmic approaches to preselective strategies for stochastic scheduling problems","volume":"13","author":"Igelmund","year":"1983","journal-title":"Networks"},{"key":"10.1016\/j.orl.2004.11.009_bib12","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/j.orl.2004.11.009_bib13","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0167-5060(08)70323-6","article-title":"Sequencing jobs to minimize total weighted completion time subject to precedence constraints","volume":"2","author":"Lawler","year":"1978","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/j.orl.2004.11.009_bib14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.26.1.22","article-title":"Complexity of scheduling under precedence constraints","volume":"26","author":"Lenstra","year":"1978","journal-title":"Oper. Res."},{"key":"10.1016\/j.orl.2004.11.009_bib15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s001860000095","article-title":"Linear preselective policies for stochastic project scheduling","volume":"52","author":"M\u00f6hring","year":"2000","journal-title":"Math. Methods Oper. Res."},{"key":"10.1016\/j.orl.2004.11.009_bib16","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1137\/S009753970037727X","article-title":"Scheduling with AND\/OR precedence constraints","volume":"33","author":"M\u00f6hring","year":"2004","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2004.11.009_bib17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","article-title":"Various optimizers for single-stage production","volume":"3","author":"Smith","year":"1956","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/j.orl.2004.11.009_bib18","unstructured":"F. Stork, A branch-and-bound algorithm for minimizing expected makespan in stochastic project networks with resource constraints. Technical Report 613, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany, 1998, revised July 2000."},{"key":"10.1016\/j.orl.2004.11.009_bib19","unstructured":"F. Stork, Stochastic resource-constrained project scheduling, Ph.D. Thesis, Institut f\u00fcr Mathematik, Technische Universit\u00e4t Berlin, Berlin, Germany, 2001."},{"key":"10.1016\/j.orl.2004.11.009_bib20","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1016\/S0022-0000(75)80008-0","article-title":"NP-complete scheduling problems","volume":"10","author":"Ullman","year":"1975","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.orl.2004.11.009_bib21","unstructured":"G. Woeginger, Personal communication with M. Skutella, February 2003, Technische Universit\u00e4t Berlin, Berlin, Germany."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001634?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637704001634?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T05:51:59Z","timestamp":1548827519000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637704001634"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["S0167637704001634"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.11.009","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}