A. Che, Y. Zeng, and L. Ke, An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs, Journal of Cleaner Production, vol.129, pp.565-577, 2016.
DOI : 10.1016/j.jclepro.2016.03.150

A. P. Rifai, H. T. Nguyen, and S. Z. , Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling, Applied Soft Computing, vol.40, pp.42-57, 2016.
DOI : 10.1016/j.asoc.2015.11.034

A. Sharma, F. Zhao, and J. W. Sutherland, Econological scheduling of a manufacturing enterprise operating under a time-of-use electricity tariff, Journal of Cleaner Production, vol.108, pp.256-270, 2015.
DOI : 10.1016/j.jclepro.2015.06.002

B. H. Zhou, L. M. Hu, and Z. Y. Zhong, A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem, Neural Computing and Applications, vol.141, issue.1, pp.1-17, 2016.
DOI : 10.1016/j.ijpe.2012.05.010

C. C. Wu and W. C. Lee, Single-machine and flowshop scheduling with a general learning effect model, Computers & Industrial Engineering, vol.56, issue.4, pp.1553-1558, 2009.
DOI : 10.1016/j.cie.2008.10.002

C. Desprez, F. Chu, and C. Chu, Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm, International Journal of Computer Integrated Manufacturing, vol.22, issue.8, pp.745-757, 2009.
DOI : 10.1002/1520-6750(199008)37:4<587::AID-NAV3220370411>3.0.CO;2-O

C. H. Pan and J. S. Chen, Mixed binary integer programming formulations for the reentrant job shop scheduling problem, Computers & Operations Research, vol.32, issue.5, pp.1197-1212, 2005.
DOI : 10.1016/j.cor.2003.10.004

C. Jing, W. Huang, and G. Tang, Minimizing total completion time for re-entrant flow shop scheduling problems, Theoretical Computer Science, vol.412, issue.48, pp.6712-6719, 2011.
DOI : 10.1016/j.tcs.2011.08.030

URL : https://doi.org/10.1016/j.tcs.2011.08.030

C. Sangsawang, K. Sethanan, T. Fujimoto, and M. Gen, Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint, Expert Systems with Applications, vol.42, issue.5, pp.2395-2410, 2015.
DOI : 10.1016/j.eswa.2014.10.043

C. Jing, W. Huang, and G. Tang, Minimizing total completion time for re-entrant flow shop scheduling problems, Theoretical Computer Science, vol.412, issue.48, pp.6712-6719, 2011.
DOI : 10.1016/j.tcs.2011.08.030

URL : https://doi.org/10.1016/j.tcs.2011.08.030

D. Ahr, J. Békési, G. Galambos, M. Oswald, and G. Reinelt, An exact algorithm for scheduling identical coupled tasks, Mathematical Methods of Operations Research (ZOR), vol.59, issue.2, pp.193-203, 2004.
DOI : 10.1007/s001860300328

D. L. Yang and M. S. Chern, Two-machine flowshop group scheduling problem, Computers & Operations Research, vol.27, issue.10, pp.975-985, 2000.
DOI : 10.1016/S0305-0548(99)00070-2

D. L. Yang, C. J. Hsu, and W. H. Kuo, A two-machine flowshop scheduling problem with a separated maintenance constraint, Computers & Operations Research, vol.35, issue.3, pp.876-883, 2008.
DOI : 10.1016/j.cor.2006.04.007

E. Demir, T. Bektas¸, G. Bektas¸, and . Laporte, The bi-objective Pollution-Routing Problem, European Journal of Operational Research, vol.232, issue.3, pp.464-478, 2014.
DOI : 10.1016/j.ejor.2013.08.002

F. Chu, C. Chu, and . Desprez, Series production in a basic re-entrant shop to minimize makespan or total flow time, Computers & Industrial Engineering, vol.58, issue.2, pp.257-268, 2010.
DOI : 10.1016/j.cie.2009.02.017

F. Dugardin, F. Yalaoui, F. , and L. Amodeo, New multi-objective method to solve reentrant hybrid flow shop scheduling problem, European Journal of Operational Research, vol.203, issue.1, pp.22-31, 2010.
DOI : 10.1016/j.ejor.2009.06.031

F. Chu, C. Chu, and . Desprez, Series production in a basic re-entrant shop to minimize makespan or total flow time, Computers & Industrial Engineering, vol.58, issue.2, pp.257-268, 2010.
DOI : 10.1016/j.cie.2009.02.017

F. Shrouf, J. Ordieres-meré, A. García-sánchez, and M. Ortega-mier, Optimizing the production scheduling of a single machine to minimize total energy consumption costs, Journal of Cleaner Production, vol.67, pp.197-207, 2014.
DOI : 10.1016/j.jclepro.2013.12.024

G. Mouzon, M. B. Yildirim, and J. Twomey, Operational methods for minimization of energy consumption of manufacturing equipment, International Journal of Production Research, vol.85, issue.18-19, pp.4247-4271, 2007.
DOI : 10.1109/92.335012

G. Mouzon and M. B. Yildirim, A framework to minimise total energy consumption and total tardiness on a single machine Production sequencing problem with re-entrant work flows and sequence dependent setup times, International Journal of Sustainable Engineering International Journal of Production Research, vol.1, issue.33, pp.105-116, 1998.

H. Luo, B. Du, G. Q. Huang, H. Chen, and X. Li, Hybrid flow shop scheduling considering machine electricity consumption cost, International Journal of Production Economics, vol.146, issue.2, pp.423-439, 2013.
DOI : 10.1016/j.ijpe.2013.01.028

J. F. Bérubé, M. Gendreau, and J. Y. Potvin, An exact -constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits, European Journal of Operational Research, vol.194, issue.1, pp.39-50, 2011.
DOI : 10.1016/j.ejor.2007.12.014

J. Shen, L. Wang, J. Deng, J. , and X. Zheng, A Pareto-Based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem, Harmony Search Algorithm, vol.382, pp.435-445, 2016.
DOI : 10.1007/978-3-662-47926-1_41

J. Xu, Y. Yin, T. C. Cheng, C. C. Wu, and S. Gu, A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan, Applied Soft Computing, vol.24, pp.277-283, 2014.
DOI : 10.1016/j.asoc.2014.07.002

J. Y. Ding, S. Song, and C. Wu, Carbon-efficient scheduling of flow shops by multi-objective optimization, European Journal of Operational Research, vol.248, issue.3, pp.758-771, 2015.
DOI : 10.1016/j.ejor.2015.05.019

J. Zoghby, J. W. Barnes, and J. J. Hasenbein, Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches, European Journal of Operational Research, vol.167, issue.2, pp.336-348, 2005.
DOI : 10.1016/j.ejor.2004.03.027

K. Amrouche, M. Boudhar, M. Bendraouche, and F. Yalaoui, Chainreentrant shop with an exact time lag: new results, International Journal of Production Research, vol.55, pp.1-11, 2016.
DOI : 10.1080/00207543.2016.1205235

K. C. Ying, S. W. Lin, and S. Y. Wan, Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm, International Journal of Production Research, vol.52, issue.19, pp.5735-5747, 2014.
DOI : 10.1016/j.eswa.2008.08.033

K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Transactions on Evolutionary Computation, vol.6, issue.2, pp.182-197, 2002.
DOI : 10.1109/4235.996017

URL : http://work.caltech.edu/amrit/papers/nsga2.ps.gz

M. Boudhar and K. Amrouche, Two machines flow shop with reentrance and exact time lag. Multidisciplinary International Scheduling Conference, pp.223-232, 2013.

R. H. Huang, S. C. Yu, and C. W. Kuo, Reentrant two-stage multiprocessor flow shop scheduling with due windows. The International Journal of Advanced Manufacturing Technology, pp.1263-1276, 2014.
DOI : 10.1007/s00170-013-5534-4

S. A. Mansouri, E. Aktas, and U. Besikci, Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption, European Journal of Operational Research, vol.248, issue.3, pp.772-788, 2016.
DOI : 10.1016/j.ejor.2015.08.064

S. C. Graves, H. C. Meal, D. Stefek, and A. H. Zeghmi, Scheduling of re-entrant flow shops, Journal of Operations Management, vol.3, issue.4, pp.197-207, 1983.
DOI : 10.1016/0272-6963(83)90004-9

S. Wang, M. Liu, and C. Chu, A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling, International Journal of Production Research, vol.8, issue.4, pp.1143-1167, 2015.
DOI : 10.1016/j.camwa.2003.08.003

URL : https://hal.archives-ouvertes.fr/hal-01273041

S. Wang, M. Liu, and C. Chu, A branch-and-bound algorithm for two-stage no-wait hybrid flow-shop scheduling, International Journal of Production Research, vol.8, issue.4, pp.1143-1167, 2015.
DOI : 10.1016/j.camwa.2003.08.003

URL : https://hal.archives-ouvertes.fr/hal-01273041

S. Wang, M. Liu, F. Chu, and C. Chu, Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration, Journal of Cleaner Production, vol.137, pp.1205-1215, 2016.
DOI : 10.1016/j.jclepro.2016.07.206

URL : https://hal.archives-ouvertes.fr/hal-01388548

S. W. Choi and Y. D. Kim, Minimizing total tardiness on a two-machine re-entrant flowshop, European Journal of Operational Research, vol.199, issue.2, pp.375-384, 2009.
DOI : 10.1016/j.ejor.2008.11.037

V. Lev, I. Adiri, and V. Scheduling, V-shop scheduling, European Journal of Operational Research, vol.18, issue.1, pp.51-56, 1984.
DOI : 10.1016/0377-2217(84)90260-1

Y. D. Kim, Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, International Journal of Production Research, vol.43, pp.2149-2167, 2005.

Z. Sun and L. Li, Opportunity Estimation for Real-Time Energy Control of Sustainable Manufacturing Systems, IEEE Transactions on Automation Science and Engineering, vol.10, issue.1, pp.38-44, 2013.
DOI : 10.1109/TASE.2012.2216876