{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T09:15:56Z","timestamp":1770887756400,"version":"3.50.1"},"reference-count":30,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,9,15]]},"abstract":"<jats:p>Facing the worsening environmental problems, green manufacturing and sustainable development have attracted much attention. Aiming at the energy-efficient distributed re-entrant hybrid flow shop scheduling problem considering the customer order constraints (EDORHFSP) under Time-of-Use (TOU) electricity price, a mathematical model is established to minimize the maximum completion time and total consumption energy cost. In the study, some customer orders require production in multiple factories and jobs belonging to the same customer order must be processed in one factory. Firstly, a memetic algorithm (MA) was proposed to solve the problem. To improve the performance of the algorithm, encoding and decoding methods, energy cost saving procedure, three heuristic rules about the population initialization and some neighborhood search methods are designed. Then, Taguchi method is adopted to research the influence of parameters setting. Lastly, numerical experiments demonstrate the effectiveness and superiority of MA for the EDORHFSP.<\/jats:p>","DOI":"10.3233\/jifs-202963","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T04:46:02Z","timestamp":1620189962000},"page":"3951-3971","source":"Crossref","is-referenced-by-count":16,"title":["A memetic algorithm for energy-efficient distributed re-entrant hybrid flow shop scheduling problem"],"prefix":"10.1177","volume":"41","author":[{"given":"Kaifeng","family":"Geng","sequence":"first","affiliation":[{"name":"School of Business, University of Shanghai for Science and Technology, Shanghai, China"},{"name":"Information Construction and Management Center, Nanyang Institute of Technology, Nanyang, Henan, China"}]},{"given":"Chunming","family":"Ye","sequence":"additional","affiliation":[{"name":"School of Business, University of Shanghai for Science and Technology, Shanghai, China"}]}],"member":"179","reference":[{"issue":"5","key":"10.3233\/JIFS-202963_ref1","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1287\/opre.45.5.702","article-title":"Minimizing Makespan in a Class of Reentrant Shops[J]","volume":"45","author":"Wang","year":"1997","journal-title":"Operations Research"},{"issue":"4","key":"10.3233\/JIFS-202963_ref2","doi-asserted-by":"crossref","first-page":"3514","DOI":"10.1016\/j.eswa.2010.08.139","article-title":"Real-time scheduling for reentrant hybrid flow shops: A decision tree based mechanism and its application to a TFT-LCD line[J]","volume":"38","author":"Choi","year":"2011","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"10.3233\/JIFS-202963_ref3","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0272-6963(83)90004-9","article-title":"Scheduling of re-entrant flow shops[J]","volume":"3","author":"Graves","year":"1983","journal-title":"Journal of Operations Management"},{"issue":"4","key":"10.3233\/JIFS-202963_ref4","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1243\/09544054JEM1318","article-title":"Heuristic algorithms for re-entrant hybrid flow shop scheduling with unrelated parallel machines[J]","volume":"223","author":"Kim","year":"2009","journal-title":"Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture"},{"issue":"1","key":"10.3233\/JIFS-202963_ref5","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ejor.2009.06.031","article-title":"New multi-objective method to solve reentrant hybrid flow shop scheduling problem[J]","volume":"203","author":"Dugardin","year":"2010","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.3233\/JIFS-202963_ref6","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cie.2011.04.008","article-title":"Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm[J]","volume":"61","author":"Cho","year":"2011","journal-title":"Computers & Industrial Engineering"},{"issue":"19","key":"10.3233\/JIFS-202963_ref7","doi-asserted-by":"crossref","first-page":"5735","DOI":"10.1080\/00207543.2014.910627","article-title":"Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm[J]","volume":"52","author":"Ying","year":"2014","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-202963_ref8","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/978-3-662-47926-1_41","volume-title":"Harmony Search Algorithm","author":"Shen","year":"2016"},{"issue":"12","key":"10.3233\/JIFS-202963_ref9","doi-asserted-by":"crossref","first-page":"3622","DOI":"10.1080\/00207543.2015.1120900","article-title":"A modified teaching\u2013learning-based optimisation algorithm for bi-objective re-entrant hybrid flowshop scheduling[J]","volume":"54","author":"Shen","year":"2016","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-202963_ref10","doi-asserted-by":"crossref","first-page":"106154","DOI":"10.1016\/j.cie.2019.106154","article-title":"Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity[J]","volume":"139","author":"Lin","year":"2020","journal-title":"Computers & Industrial Engineering"},{"key":"10.3233\/JIFS-202963_ref12","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.jclepro.2017.01.011","article-title":"Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm[J]","volume":"144","author":"Lu","year":"2017","journal-title":"Journal of Cleaner Production"},{"issue":"2","key":"10.3233\/JIFS-202963_ref13","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/j.cirp.2008.09.010","article-title":"The incoming global technological and industrial revolution towards competitive sustainable manufacturing[J]","volume":"57","author":"Jovane","year":"2008","journal-title":"CIRP Annals"},{"issue":"5","key":"10.3233\/JIFS-202963_ref14","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","article-title":"A Knowledge-Based Cooperative Algorithm for Energy-Efficient Scheduling of Distributed Flow-Shop[J]","volume":"50","author":"Wang","year":"2020","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"1","key":"10.3233\/JIFS-202963_ref15","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TASE.2012.2202226","article-title":"Energy-Efficient Production Systems Through Schedule-Based Operations[J]","volume":"10","author":"Chen","year":"2013","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"10.3233\/JIFS-202963_ref16","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1016\/j.cor.2017.04.004","article-title":"Energy-efficient bi-objective single-machine scheduling with power-down mechanism[J]","volume":"85","author":"Che","year":"2017","journal-title":"Computers & Operations Research"},{"key":"10.3233\/JIFS-202963_ref17","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1016\/j.omega.2019.102117","article-title":"Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search[J]","volume":"94","author":"Wu","year":"2020","journal-title":"Omega"},{"issue":"1","key":"10.3233\/JIFS-202963_ref18","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/s10479-015-2003-5","article-title":"Scheduling on a single machine under time-of-use electricity tariffs[J]","volume":"238","author":"Fang","year":"2016","journal-title":"Annals of Operations Research"},{"key":"10.3233\/JIFS-202963_ref19","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","article-title":"A memetic differential evolution algorithm for energy-efficient parallel machine scheduling[J]","volume":"82","author":"Wu","year":"2019","journal-title":"Omega"},{"issue":"2","key":"10.3233\/JIFS-202963_ref20","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/TASE.2015.2495328","article-title":"Parallel Machine Scheduling Under Time-of-Use Electricity Prices: New Models and Optimization Approaches[J]","volume":"13","author":"Ding","year":"2016","journal-title":"IEEE Transactions on Automation Science and Engineering"},{"key":"10.3233\/JIFS-202963_ref21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2020\/8565921","article-title":"Bi-Objective Re-Entrant Hybrid Flow Shop Scheduling considering Energy Consumption Cost under Time-of-Use Electricity Tariffs[J]","volume":"2020","author":"Geng","year":"2020","journal-title":"Complexity"},{"key":"10.3233\/JIFS-202963_ref22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.cor.2020.105088","article-title":"Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization[J]","volume":"125","author":"Ding","year":"2021","journal-title":"Computers & Operations Research"},{"key":"10.3233\/JIFS-202963_ref23","doi-asserted-by":"crossref","first-page":"118420","DOI":"10.1016\/j.energy.2020.118420","article-title":"Energy-efficient scheduling of a single batch processing machine with dynamic job arrival times[J]","volume":"209","author":"Zhou","year":"2020","journal-title":"Energy"},{"issue":"13","key":"10.3233\/JIFS-202963_ref24","doi-asserted-by":"crossref","first-page":"4103","DOI":"10.1080\/00207543.2019.1642529","article-title":"Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm[J]","volume":"58","author":"Zheng","year":"2020","journal-title":"International Journal of Production Research"},{"issue":"18","key":"10.3233\/JIFS-202963_ref25","doi-asserted-by":"crossref","first-page":"5235","DOI":"10.1080\/00207540903121065","article-title":"Distributed scheduling: a review of concepts and applications[J]","volume":"48","author":"Toptal","year":"2010","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.3233\/JIFS-202963_ref26","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1080\/00207543.2011.644819","article-title":"An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem[J]","volume":"51","author":"Gao","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"16","key":"10.3233\/JIFS-202963_ref27","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","article-title":"Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm[J]","volume":"51","author":"Lin","year":"2013","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-202963_ref28","doi-asserted-by":"crossref","first-page":"104894","DOI":"10.1016\/j.knosys.2019.104894","article-title":"A distributed permutation flowshop scheduling problem with the customer order constraint[J]","volume":"184","author":"Meng","year":"2019","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-202963_ref29","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/j.cor.2016.09.010","article-title":"New approximate algorithms for the customer order scheduling problem with total completion time objective[J]","volume":"78","author":"Framinan","year":"2017","journal-title":"Computers & Operations Research"},{"issue":"3","key":"10.3233\/JIFS-202963_ref30","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1016\/j.ejor.2017.10.064","article-title":"Order scheduling with tardiness objective: Improved approximate solutions[J]","volume":"266","author":"Framinan","year":"2018","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"10.3233\/JIFS-202963_ref31","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.cor.2003.10.004","article-title":"Mixed binary integer programming formulations for the reentrant job shop scheduling problem[J]","volume":"32","author":"Pan","year":"2005","journal-title":"Computers & Operations Research"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-202963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T03:22:38Z","timestamp":1770002558000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-202963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,15]]},"references-count":30,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/jifs-202963","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,15]]}}}