Bi-objective optimization of a reentrant flow shop scheduling with exact time lag considering energy cost

— In this paper, we study a bi-objective optimization of the two-machine reentrant flow shop scheduling problem with an exact time lag considering energy consumption cost. This problem is proposed by Amrouche et al. (2016), in which each job must be operated from the first machine M1 to the second machine M2 and then back to the first machine M1 with an exact time lag lj between the two operations on the first machine. The two objectives are: (1) minimization of the total energy consumption cost and (2) makespan. To describe the problem precisely, we propose a bi-objective mixed integer programming formulation. An-constraint method and NSGA-II approach are proposed to obtain the optimal Pareto front and approximate Pareto solutions for the problem. The frameworks of the proposed methods are presented in this paper.

[1]  Shijin Wang,et al.  Bi-objective optimization of a single machine batch scheduling problem with energy cost consideration , 2016 .

[2]  Yeong-Dae Kim,et al.  Minimizing total tardiness on a two-machine re-entrant flowshop , 2009, Eur. J. Oper. Res..

[3]  Maw-Sheng Chern,et al.  Two-machine flowshop group scheduling problem , 2000, Computers & Operations Research.

[4]  Feng Chu,et al.  Minimising the weighted number of tardy jobs in a hybrid flow shop with genetic algorithm , 2009, Int. J. Comput. Integr. Manuf..

[5]  Mourad Boudhar,et al.  Two machines flow shop with reentrance and exact time lag , 2016, RAIRO Oper. Res..

[6]  Mourad Boudhar,et al.  Chain-reentrant shop with an exact time lag: new results , 2017, Int. J. Prod. Res..

[7]  Ada Che,et al.  An efficient greedy insertion heuristic for energy-conscious single machine scheduling problem under time-of-use electricity tariffs , 2016 .

[8]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[9]  Jen-Shiang Chen,et al.  Mixed binary integer programming formulations for the reentrant job shop scheduling problem , 2005, Comput. Oper. Res..

[10]  George Q. Huang,et al.  Hybrid flow shop scheduling considering machine electricity consumption cost , 2013 .

[11]  Guochun Tang,et al.  Minimizing total completion time for re-entrant flow shop scheduling problems , 2011, Theor. Comput. Sci..

[12]  Bing-hai Zhou,et al.  A hybrid differential evolution algorithm with estimation of distribution algorithm for reentrant hybrid flow shop scheduling problem , 2016, Neural Computing and Applications.

[13]  J. Wesley Barnes,et al.  Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches , 2005, Eur. J. Oper. Res..

[14]  Lionel Amodeo,et al.  New multi-objective method to solve reentrant hybrid flow shop scheduling problem , 2010, Eur. J. Oper. Res..

[15]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[16]  J. U. Sun,et al.  PRODUCTION SEQUENCING PROBLEM WITH RE-ENTRANT WORK FLOWS AND SEQUENCE DEPENDENT SETUP TIMES , 1998 .

[17]  Siti Zawiah Md Dawal,et al.  Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling , 2016, Appl. Soft Comput..

[18]  Shih-Wei Lin,et al.  Bi-objective reentrant hybrid flowshop scheduling: an iterated Pareto greedy algorithm , 2014 .

[19]  Mehmet Bayram Yildirim,et al.  A framework to minimise total energy consumption and total tardiness on a single machine , 2008 .

[20]  Wen-Chiung Lee,et al.  Single-machine and flowshop scheduling with a general learning effect model , 2009, Comput. Ind. Eng..

[21]  Gerhard Reinelt,et al.  An exact algorithm for scheduling identical coupled tasks , 2004, Math. Methods Oper. Res..

[22]  Rong-Hwa Huang,et al.  Reentrant two-stage multiprocessor flow shop scheduling with due windows , 2014 .

[23]  T. C. Edwin Cheng,et al.  A memetic algorithm for the re-entrant permutation flowshop scheduling problem to minimize the makespan , 2014, Appl. Soft Comput..

[24]  Ling Wang,et al.  A Pareto-Based Discrete Harmony Search Algorithm for Bi-objective Reentrant Hybrid Flowshop Scheduling Problem , 2015, ICHSA.

[25]  Fu Zhao,et al.  Econological scheduling of a manufacturing enterprise operating under a time-of-use electricity tariff , 2015 .

[26]  Cheng Wu,et al.  Carbon-efficient scheduling of flow shops by multi-objective optimization , 2016, Eur. J. Oper. Res..

[27]  I. Adiri,et al.  V-shop scheduling , 1984 .

[28]  Joaquín B. Ordieres Meré,et al.  Optimizing the production scheduling of a single machine to minimize total energy consumption costs , 2014 .

[29]  Mitsuo Gen,et al.  Metaheuristics optimization approaches for two-stage reentrant flexible flow shop with blocking constraint , 2015, Expert Syst. Appl..

[30]  Janet M. Twomey,et al.  Operational methods for minimization of energy consumption of manufacturing equipment , 2007 .

[31]  S.-W. Choi,et al.  Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop , 2003 .

[32]  Feng Chu,et al.  Series production in a basic re-entrant shop to minimize makespan or total flow time , 2010, Comput. Ind. Eng..

[33]  Gilbert Laporte,et al.  The bi-objective Pollution-Routing Problem , 2014, Eur. J. Oper. Res..

[34]  Chou-Jung Hsu,et al.  A two-machine flowshop scheduling problem with a separated maintenance constraint , 2008, Comput. Oper. Res..

[35]  Zeyi Sun,et al.  Opportunity Estimation for Real-Time Energy Control of Sustainable Manufacturing Systems , 2013, IEEE Transactions on Automation Science and Engineering.

[36]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .