乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,27]],"date-time":"2023-12-27T16:31:03Z","timestamp":1703694663380},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2012,9,1]],"date-time":"2012-09-01T00:00:00Z","timestamp":1346457600000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1016\/j.ejor.2012.03.040","type":"journal-article","created":{"date-parts":[[2012,3,30]],"date-time":"2012-03-30T19:16:35Z","timestamp":1333134995000},"page":"296-305","source":"Crossref","is-referenced-by-count":14,"title":["Parallel dedicated machines scheduling with chain precedence constraints"],"prefix":"10.1016","volume":"221","author":[{"given":"Alessandro","family":"Agnetis","sequence":"first","affiliation":[]},{"given":"Hans","family":"Kellerer","sequence":"additional","affiliation":[]},{"given":"Gaia","family":"Nicosia","sequence":"additional","affiliation":[]},{"given":"Andrea","family":"Pacifici","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ejor.2012.03.040_b0005","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/70.345934","article-title":"Task assignment and sub-assembly scheduling in flexible assembly lines","volume":"11","author":"Agnetis","year":"1995","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"3","key":"10.1016\/j.ejor.2012.03.040_b0010","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1016\/j.ejor.2009.07.001","article-title":"Scheduling three chains on two parallel machines","volume":"202","author":"Agnetis","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.03.040_b0015","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10951-010-0162-4","article-title":"A job-shop problem with one additional resource type","volume":"14","author":"Agnetis","year":"2011","journal-title":"Journal of Scheduling"},{"issue":"1","key":"10.1016\/j.ejor.2012.03.040_b0020","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10479-006-0151-3","article-title":"Minimum cost multi-product flow lines","volume":"150","author":"Alfieri","year":"2007","journal-title":"Annals of Operations Research"},{"key":"10.1016\/j.ejor.2012.03.040_b0025","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1287\/opre.4.2.244","article-title":"A graphical approach to production scheduling problems","volume":"4","author":"Akers","year":"1956","journal-title":"Operations Research"},{"issue":"4","key":"10.1016\/j.ejor.2012.03.040_b0030","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/opre.3.4.429","article-title":"A non-numerical approach to production scheduling problems","volume":"3","author":"Akers","year":"1955","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.03.040_b0035","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/S0377-2217(01)00379-4","article-title":"Review of properties of different precedence graphs for scheduling problems","volume":"142","author":"Blazewicz","year":"2002","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2012.03.040_b0040","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02276919","article-title":"An efficient algorithm for the job-shop problem with two jobs","volume":"40","author":"Brucker","year":"1988","journal-title":"Computing"},{"issue":"3","key":"10.1016\/j.ejor.2012.03.040_b0045","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/s00186-006-0127-8","article-title":"Complexity of shop-scheduling problems with fixed number of jobs: a survey","volume":"65","author":"Brucker","year":"2007","journal-title":"Mathematical Methods of Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2012.03.040_b0050","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Annals of Mathematics"},{"key":"10.1016\/j.ejor.2012.03.040_b0055","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"issue":"4","key":"10.1016\/j.ejor.2012.03.040_b0060","first-page":"701","article-title":"Note on Dilworth\u2019s decomposition theorem for partially ordered sets","volume":"7","author":"Fulkerson","year":"1956","journal-title":"Proceedings of the American Mathematical Society"},{"issue":"6","key":"10.1016\/j.ejor.2012.03.040_b0065","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1287\/opre.11.6.889","article-title":"A geometric model and a graphical algorithm for a sequencing problem","volume":"11","author":"Hardgrave","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.03.040_b0070","first-page":"61","article-title":"Job-shop with two jobs and irregular criteria","volume":"5","author":"Hendel","year":"2008","journal-title":"International Journal of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.03.040_b0075","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/S0377-2217(96)00247-0","article-title":"Heuristics for unrelated machine scheduling with precedence constraints","volume":"102","author":"Herrmann","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/j.ejor.2012.03.040_b0080","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-2217(02)00246-1","article-title":"Scheduling parallel dedicated machines under a single non-shared resource","volume":"174","author":"Kellerer","year":"2003","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/j.ejor.2012.03.040_b0085","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0166-218X(03)00433-5","article-title":"Scheduling problems for parallel dedicated machines under multiple resource constraints","volume":"133","author":"Kellerer","year":"2004","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/j.ejor.2012.03.040_b0090","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s00453-007-9004-y","article-title":"Scheduling on unrelated machines under tree-like precedence constraints","volume":"55","author":"Kumar","year":"2009","journal-title":"Algorithmica"},{"key":"10.1016\/j.ejor.2012.03.040_b0095","series-title":"Optimal Scheduling of Two Jobs with a Regular Criterion","author":"Sotskov","year":"1985"},{"key":"10.1016\/j.ejor.2012.03.040_b0100","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1016\/0377-2217(91)90066-5","article-title":"The complexity of shop-scheduling problems with two or three jobs","volume":"53","author":"Sotskov","year":"1991","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"10.1016\/j.ejor.2012.03.040_b0105","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0166-218X(95)80004-N","article-title":"NP-hardness of shop-scheduling problems with three jobs","volume":"59","author":"Sotskov","year":"1995","journal-title":"Discrete Applied Mathematics"},{"issue":"6","key":"10.1016\/j.ejor.2012.03.040_b0110","doi-asserted-by":"crossref","first-page":"782","DOI":"10.1287\/opre.8.6.782","article-title":"Solution of the Akers\u2013Friedman scheduling problem","volume":"8","author":"Szwarc","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/j.ejor.2012.03.040_b0115","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s00170-010-2642-2","article-title":"A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem","volume":"51","author":"Wang","year":"2010","journal-title":"The International Journal of Advanced Manufacturing Technology"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712002500?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221712002500?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,11,24]],"date-time":"2018-11-24T18:51:24Z","timestamp":1543085484000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221712002500"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["S0377221712002500"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2012.03.040","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2012,9]]}}}