{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T15:58:57Z","timestamp":1723132737311},"reference-count":28,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,5,1]],"date-time":"2024-05-01T00:00:00Z","timestamp":1714521600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1016\/j.ejor.2023.11.008","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T19:34:47Z","timestamp":1699472087000},"page":"882-893","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing"],"prefix":"10.1016","volume":"314","author":[{"ORCID":"http:\/\/orcid.org\/0000-0003-3094-4347","authenticated-orcid":false,"given":"Weidong","family":"Li","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7419-3808","authenticated-orcid":false,"given":"Jinwen","family":"Ou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/j.ejor.2023.11.008_b1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","article-title":"Approximation schemes for scheduling on parallel machines","volume":"1","author":"Alon","year":"1998","journal-title":"Journal of Scheduling"},{"key":"10.1016\/j.ejor.2023.11.008_b2","doi-asserted-by":"crossref","unstructured":"Angel, E., Bampis, E., & Kononov, A. (2001). A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In Proceedings of the 9th annual European symposium on algorithms (pp. 194\u2013205).","DOI":"10.1007\/3-540-44676-1_16"},{"issue":"4","key":"10.1016\/j.ejor.2023.11.008_b3","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning: A survey","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Review"},{"key":"10.1016\/j.ejor.2023.11.008_b4","series-title":"Approximation algorithms for NP-hard problems","first-page":"46","article-title":"Approximation algorithms for bin packing: a survey","author":"Coffman","year":"1997"},{"key":"10.1016\/j.ejor.2023.11.008_b5","article-title":"The flexible job shop scheduling problem: A review","author":"Dauz\u00e9re-P\u00e8r\u00e9s","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.1016\/j.ejor.2023.11.008_b6","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1016\/j.jmsy.2011.08.004","article-title":"A new approach to scheduling in manufacturing for power consumption and carbon footprint reduction","volume":"30","author":"Fang","year":"2011","journal-title":"Journal of Manufacturing Systems"},{"issue":"1","key":"10.1016\/j.ejor.2023.11.008_b7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2021.06.012","article-title":"A survey of scheduling with parallel batch (p-batch) processing","volume":"298","author":"Fowler","year":"2022","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2023.11.008_b8","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/j.ejor.2023.05.040","article-title":"Exact and heuristic solution approaches for energy-efficient identical parallel machine scheduling with time-of-use costs","volume":"311","author":"Gaggero","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2023.11.008_b9","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.ejor.2022.03.045","article-title":"Production, maintenance and resource scheduling: A review","volume":"305","author":"Geurtsen","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/j.ejor.2023.11.008_b10","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1002\/nav.20202","article-title":"Parallel machine scheduling with job assignment restrictions","volume":"54","author":"Glass","year":"2017","journal-title":"Naval Research Logistics"},{"issue":"3","key":"10.1016\/j.ejor.2023.11.008_b11","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0217033","article-title":"A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach","volume":"17","author":"Hochbaum","year":"1988","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"10.1016\/j.ejor.2023.11.008_b12","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/j.ejor.2022.06.021","article-title":"Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time","volume":"305","author":"Jiang","year":"2023","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/j.ejor.2023.11.008_b13","article-title":"Approximation algorithms for bi-objective parallel-machine scheduling in green manufacturing","volume":"176","author":"Jiang","year":"2023","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/j.ejor.2023.11.008_b14","series-title":"Knapsack problems","author":"Kellerer","year":"2004"},{"issue":"11","key":"10.1016\/j.ejor.2023.11.008_b15","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.tcs.2019.05.024","article-title":"Minimizing machine assignment costs over \u0394-approximate solutions of the scheduling problem P||Cmax","volume":"793","author":"Kononov","year":"2019","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"10.1016\/j.ejor.2023.11.008_b16","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ejor.2014.03.026","article-title":"Fast approximation algorithms for bi-criteria scheduling with machine assignment costs","volume":"238","author":"Lee","year":"2014","journal-title":"European Journal of Operational Research"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2023.11.008_b17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","article-title":"Approximation algorithms for scheduling unrelated parallel machines","volume":"46","author":"Lenstra","year":"1990","journal-title":"Mathematical Programming"},{"issue":"5","key":"10.1016\/j.ejor.2023.11.008_b18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ijpe.2014.09.038","article-title":"Scheduling with processing set restrictions: A literature update","volume":"175","author":"Leung","year":"2016","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"10.1016\/j.ejor.2023.11.008_b19","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/j.ijpe.2012.05.016","article-title":"Bi-criteria scheduling with machine assignment costs","volume":"139","author":"Leung","year":"2012","journal-title":"International Journal of Production Economics"},{"issue":"3","key":"10.1016\/j.ejor.2023.11.008_b20","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/j.cor.2006.04.002","article-title":"A new modeling and solution approach for the set-partitioning problem","volume":"35","author":"Lewisa","year":"2008","journal-title":"Computers & Operations Research"},{"issue":"1","key":"10.1016\/j.ejor.2023.11.008_b21","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.jmsy.2015.11.006","article-title":"Parallel machine scheduling problems in green manufacturing industry","volume":"38","author":"Li","year":"2016","journal-title":"Journal of Manufacturing Systems"},{"issue":"3","key":"10.1016\/j.ejor.2023.11.008_b22","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1016\/j.ejor.2015.08.064","article-title":"Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption","volume":"248","author":"Mansouri","year":"2016","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"10.1016\/j.ejor.2023.11.008_b23","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1002\/nav.20286","article-title":"Scheduling parallel machines with inclusive processing set restrictions","volume":"55","author":"Ou","year":"2008","journal-title":"Naval Research Logistics"},{"issue":"3","key":"10.1016\/j.ejor.2023.11.008_b24","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/j.ejor.2014.09.028","article-title":"An improved heuristic for parallel machine scheduling with rejection","volume":"241","author":"Ou","year":"2015","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.1016\/j.ejor.2023.11.008_b25","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<203::AID-JOS26>3.0.CO;2-5","article-title":"Polynomial time approximation algorithms for machine scheduling: Ten open problems","volume":"2","author":"Schuurman","year":"1999","journal-title":"Journal of Scheduling"},{"issue":"1\u20133","key":"10.1016\/j.ejor.2023.11.008_b26","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","article-title":"An approximation algorithm for the generalized assignment problem","volume":"62","author":"Shmoys","year":"1993","journal-title":"Mathematical Programming"},{"issue":"4","key":"10.1016\/j.ejor.2023.11.008_b27","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1109\/TEM.2011.2171055","article-title":"Single-machine sustainable production planning to minimize total energy consumption and total completion time using a multiple objective genetic algorithm","volume":"59","author":"Yildirim","year":"2012","journal-title":"IEEE Transactions on Engineering Management"},{"issue":"2","key":"10.1016\/j.ejor.2023.11.008_b28","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2022.01.003","article-title":"Coordinated scheduling of the outsourcing, in-house production and distribution operations","volume":"302","author":"Zhong","year":"2022","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221723008470?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221723008470?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,26]],"date-time":"2024-01-26T01:02:29Z","timestamp":1706230949000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221723008470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["S0377221723008470"],"URL":"https:\/\/doi.org\/10.1016\/j.ejor.2023.11.008","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2024,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing","name":"articletitle","label":"Article Title"},{"value":"European Journal of Operational Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejor.2023.11.008","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2023 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}