{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:28:57Z","timestamp":1767637737380,"version":"3.48.0"},"reference-count":29,"publisher":"Maximum Academic Press","issue":"5","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"unspecified","delay-in-days":72,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2016,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Many real life problems can be modeled as a scheduling problem. The main objective of these problems is to obtain optimal solutions in terms of processing time, cost and quality. Nowadays, energy-efficiency is also taken into consideration. However, these problems are NP-hard, so many search techniques are not able to obtain a solution in a reasonable time. In this paper, a genetic algorithm is developed to solve an extended version of the classical job-shop scheduling problem. In the extended version, each operation has to be executed by one machine and this machine can work at different speed rates. The machines consume different amounts of energy to process tasks at different rates. The evaluation section shows that a powerful commercial tools for solving scheduling problems was not able to solve large instances in a reasonable time, meanwhile our genetic algorithm was able to solve all instances with a good solution quality.<\/jats:p>","DOI":"10.1017\/s026988891600031x","type":"journal-article","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T03:09:46Z","timestamp":1484190586000},"page":"475-485","source":"Crossref","is-referenced-by-count":22,"title":["A metaheuristic technique for energy-efficiency in job-shop scheduling"],"prefix":"10.48130","volume":"31","author":[{"given":"Joan","family":"Escamilla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Salido","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adriana","family":"Giret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Federico","family":"Barber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"key":"S026988891600031X_ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2004.07.005"},{"key":"S026988891600031X_ref26","doi-asserted-by":"crossref","unstructured":"Varela R. , Serrano D. & Sierra M. (2005). New codification schemas for scheduling with genetic algorithms. In Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach, 11\u201320. Springer.","DOI":"10.1007\/11499305_2"},{"key":"S026988891600031X_ref9","doi-asserted-by":"crossref","unstructured":"Dahmus J. & Gutowski T. 2004. An environmental analysis of machining. In ASME International Mechanical Engineering Congress and RD&D Exposition.","DOI":"10.1115\/IMECE2004-62600"},{"key":"S026988891600031X_ref21","doi-asserted-by":"publisher","DOI":"10.1080\/19397030802257236"},{"key":"S026988891600031X_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirp.2011.03.015"},{"key":"S026988891600031X_ref16","unstructured":"IBM 2007. Modeling with IBM ILOG CP optimizer \u2013 practical scheduling examples. IBM."},{"key":"S026988891600031X_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2013.04.001"},{"key":"S026988891600031X_ref6","first-page":"1","article-title":"Scheduling under resource constraints-deterministic models","volume":"7","author":"Blazewicz","year":"1986","journal-title":"Annals of Operations Research"},{"key":"S026988891600031X_ref5","doi-asserted-by":"publisher","DOI":"10.1002\/9780470611432"},{"key":"S026988891600031X_ref17","doi-asserted-by":"crossref","unstructured":"Laborie P. 2009. IBM ILOG CP optimizer for detailed scheduling illustrated on three problems. In Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR09), 148\u2013162.","DOI":"10.1007\/978-3-642-01929-6_12"},{"key":"S026988891600031X_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10845-012-0629-6"},{"key":"S026988891600031X_ref18","doi-asserted-by":"crossref","unstructured":"Li W. , Zein A. , Kara S. & Herrmann C. (2011). An investigation into fixed energy consumption of machine tools. In Glocalized Solutions for Sustainability in Manufacturing, Hesselbach, J. & Herrmann, C. (eds), 268\u2013273. Springer.","DOI":"10.1007\/978-3-642-19692-8_47"},{"key":"S026988891600031X_ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888910000202"},{"key":"S026988891600031X_ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-010-0162-4"},{"key":"S026988891600031X_ref22","doi-asserted-by":"publisher","DOI":"10.1080\/00207540701450013"},{"key":"S026988891600031X_ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmsy.2011.08.004"},{"key":"S026988891600031X_ref24","unstructured":"Salido M. A. , Escamilla J. , Barber F. , Giret A. , Tang D. & Dai M. (2013). 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, 44\u201353."},{"key":"S026988891600031X_ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirp.2012.03.084"},{"key":"S026988891600031X_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.060"},{"key":"S026988891600031X_ref14","unstructured":"Garrido A. , Salido M. A. , Barber F. & Lopez M. (2000). Heuristic methods for solving job-shop scheduling problems. In ECAI-2000 Workshop on New Results in Planning, Scheduling and Design, 36\u201343."},{"key":"S026988891600031X_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2003.08.005"},{"key":"S026988891600031X_ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirpj.2011.06.017"},{"key":"S026988891600031X_ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirp.2012.05.002"},{"key":"S026988891600031X_ref27","unstructured":"Watson J.-P. , Barbulescu L. , Howe A. E. & Whitley L. D. (1999). Algorithm performance and problem structure for flow-shop scheduling. In AAAI\/IAAI, 688\u2013695."},{"key":"S026988891600031X_ref12","unstructured":"Escamilla J. , Salido M. A. , Giret A. & Barber F. (2014). A metaheuristic technique for energy-efficiency in job-shop scheduling. In COPLAS\u2019 2014: ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling, 42\u201350."},{"key":"S026988891600031X_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.cirpj.2011.03.007"},{"key":"S026988891600031X_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2006.07.003"},{"key":"S026988891600031X_ref4","first-page":"58","article-title":"An overview of genetic algorithms: part 1. Fundamentals","volume":"15","author":"Beasley","year":"1993","journal-title":"University Computing"},{"key":"S026988891600031X_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2013.02.030"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S026988891600031X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:05Z","timestamp":1767624125000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S026988891600031X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":29,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,11]]}},"alternative-id":["S026988891600031X"],"URL":"https:\/\/doi.org\/10.1017\/s026988891600031x","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2016,11]]}}}