{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,3]],"date-time":"2025-08-03T04:07:48Z","timestamp":1754194068629},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319125671"},{"type":"electronic","value":"9783319125688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44736-9_16","type":"book-chapter","created":{"date-parts":[[2014,8,25]],"date-time":"2014-08-25T22:55:44Z","timestamp":1409007344000},"page":"130-137","source":"Crossref","is-referenced-by-count":3,"title":["A GRASPxELS for Scheduling of Job-Shop Like Manufacturing Systems and CO2 Emission Reduction"],"prefix":"10.1007","author":[{"given":"Sylverin","family":"Kemmoe Tchomte","sequence":"first","affiliation":[]},{"given":"Nikolay","family":"Tchernev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Salido, M.A., Escamilla, J., Barber, F., Giret, A., Tang, D., Dai, M.: Energy-aware Parameters in Job-shop Scheduling Problems. In: GREEN-COPLAS 2013: IJCAI 2013 Workshop on Constraint Reasoning, Planning and Scheduling Problems for a Sustainable Future, Beijing, China, pp. 44\u201353 (2013)"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1287\/moor.1.2.117","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Seth, R.: The complexity of flowshop and jobshop scheduling. Math. of Oper. Res.\u00a01, 117\u2013129 (1976)","journal-title":"Math. of Oper. Res."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"S. Jain","year":"1999","unstructured":"Jain, S., Meeran, S.: Deterministic job-shop scheduling: Past, present and future. E. J. of Oper. Res.\u00a0113, 390\u2013434 (1999)","journal-title":"E. J. of Oper. Res."},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1016\/j.cie.2011.01.003","volume":"60","author":"L. Gao","year":"2011","unstructured":"Gao, L., Zhang, D., Zhang, L., Li, X.: An efficient memetic algorithm for solving the job shop scheduling problem. C. & Ind. Eng.\u00a060, 699\u2013705 (2011)","journal-title":"C. & Ind. Eng."},{"issue":"2","key":"16_CR5","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1016\/j.eswa.2013.07.080","volume":"41","author":"M. Chassaing","year":"2014","unstructured":"Chassaing, M., Fontanel, J., Lacomme, P., Ren, L., Tchernev, N., Viullechenon, P.: A GRASP \u00d7 ELS approach for the job-shop with a web service paradigm packaging. Exp. S. with Appl.\u00a041(2), 544\u2013562 (2014)","journal-title":"Exp. S. with Appl."},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s11771-005-0033-x","volume":"12","author":"Y. He","year":"2005","unstructured":"He, Y., Lui, F., Cao, H.J., Li, C.: A bi-objective model for job-shop scheduling problem to minimize both energy consumption and makespan. J. Cent. South Uni. Techn.\u00a012(2), 167\u2013171 (2005)","journal-title":"J. Cent. South Uni. Techn."},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jclepro.2013.07.060","volume":"65","author":"Y. Liu","year":"2014","unstructured":"Liu, Y., Dong, H., Lohse, N., Petrovic, S., Gindy, N.: An investigation into minimizing total energy consumption and total weighted tardiness in job shops. J. Clean. Prod.\u00a065, 87\u201396 (2014)","journal-title":"J. Clean. Prod."},{"issue":"4","key":"16_CR8","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1109\/TEM.2011.2171055","volume":"59","author":"M.B. Yildirim","year":"2011","unstructured":"Yildirim, M.B., Mouzon, G.: Single-machine sustainable production planning to minimize total energy consumption and total completion time using a multiple objective genetic algorithm. IEEE Tr. on Eng. Man.\u00a059(4), 585\u2013597 (2011)","journal-title":"IEEE Tr. on Eng. Man."},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10479-012-1294-z","volume":"206","author":"K. Fang","year":"2013","unstructured":"Fang, K., Uhan, N., Zhao, F., Sutherland, J.: Flow shop scheduling with peak power consumption constraints. A. of Op. Res.\u00a0206(1), 115\u2013145 (2013)","journal-title":"A. of Op. Res."},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ijpe.2013.01.028","volume":"146","author":"H. Luo","year":"2013","unstructured":"Luo, H., Huang, G., Chen, H., Li, X.: Hybrid flow shop scheduling considering machine electricity consumption cost. I. J. Prod. Ec.\u00a0146, 423\u2013439 (2013)","journal-title":"I. J. Prod. Ec."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1016\/j.cirp.2012.03.084","volume":"61","author":"A.A.G. Bruzzone","year":"2012","unstructured":"Bruzzone, A.A.G., Anghinolfi, D., Paolucci, M., Tonelli, F.: Energy-aware scheduling for improving manufacturing process sustainability: a mathematical model for flexible flowshops. CIRP Ann.\u2013Man. Techn.\u00a061(1), 459\u2013462 (2012)","journal-title":"CIRP Ann.\u2013Man. Techn."},{"key":"16_CR12","series-title":"SCI","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-85152-3_2","volume-title":"Bio-Inspired Algorithms for the Vehicle Routing Problem","author":"C. Prins","year":"2009","unstructured":"Prins, C.: A GRASP x evolutionary local search hybrid for the vehicle routing problem. In: Pereira, F.B., Tavares, J. (eds.) Bio-Inspired Algorithms for the Vehicle Routing Problem. SCI, vol.\u00a061, pp. 35\u201353. Springer, Heidelberg (2009)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T.A. Feo","year":"1989","unstructured":"Feo, T.A., Resende, M.G.C.: A probabilistic heuristic for a computationally difficult set covering problem. Op. Res. Let.\u00a08, 67\u201371 (1989)","journal-title":"Op. Res. Let."},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"2005","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. of Gl. Opt.\u00a06, 109\u2013133 (2005)","journal-title":"J. of Gl. Opt."},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Op. Res.\u00a042, 860\u2013878 (1994)","journal-title":"Op. Res."},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"ORMS, Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2003","unstructured":"Resende, M.G.C., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) ORMS, Handbook of Metaheuristics, pp. 219\u2013249. Kluwer Academic Publishers, Dordrecht (2003)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.1475-3995.2009.00663.x","volume":"16","author":"P. Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRAS part I: algorithms. Int. Trans. in Op. Res.\u00a016, 1\u201324 (2009)","journal-title":"Int. Trans. in Op. Res."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1111\/j.1475-3995.2009.00664.x","volume":"16","author":"P. Festa","year":"2009","unstructured":"Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP part II: applications. Int. Trans. in Op. Res.\u00a016, 131\u2013172 (2009)","journal-title":"Int. Trans. in Op. Res."},{"key":"16_CR19","unstructured":"Roy, B., Sussmann, B.: Les probl\u00e8mes d\u2019ordonnancement avec contraintes disjunctive, In: Note DS N\u00b09 bis, SEMA, Paris (1964)"},{"key":"16_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/BF01719250","volume":"17","author":"C. Bierwirth","year":"1995","unstructured":"Bierwirth, C.: A Generalized permutation approach to Job Shop scheduling with genetic algorithms. OR Spektrum\u00a017, 87\u201392 (1995)","journal-title":"OR Spektrum"},{"issue":"1","key":"16_CR21","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1287\/opre.40.1.113","volume":"40","author":"P.J.M. Laarhoven Van","year":"1992","unstructured":"Van Laarhoven, P.J.M., Aarts, E.H.L., Lenstra, J.K.: Jobshop scheduling by simulated annealing. Op. Res.\u00a040(1), 113\u2013125 (1992)","journal-title":"Op. Res."}],"container-title":["Lecture Notes in Computer Science","Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44736-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T14:02:51Z","timestamp":1558965771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44736-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319125671","9783319125688"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44736-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}