Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption

ABSTRACT The resource constrained scheduling problem has been investigated widely in recent years, and many heuristic algorithms have been applied to solve this problem. In this study, we propose a discrete imperialist competitive algorithm (DICA) to solve a variety of resource-constrained hybrid flowshop scheduling problems with the objective of minimizing the completion time. In the proposed algorithm, we employ a two-phase-based coding mechanism, where a local search method is applied. Then, we combine DICA and simulated annealing algorithm (SA) to improve the performance of the algorithm. In addition, we consider the dynamic allocation of resources in the decoding process. We tested the proposed algorithm based on a randomly generated set of real shop scheduling system instances, as well as numerically analyzing and comparing the proposed algorithm with existing heuristic algorithms to verify its effectiveness.

[1]  Panos M. Pardalos,et al.  A hybrid BA-VNS algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers , 2017, Omega.

[2]  Quan-Ke Pan,et al.  An Improved Artificial Bee Colony Algorithm for Solving Hybrid Flexible Flowshop With Dynamic Operation Skipping , 2016, IEEE Transactions on Cybernetics.

[3]  Jaime Cerdá,et al.  An MILP continuous-time approach to short-term scheduling of resource-constrained multistage flowshop batch facilities , 2001 .

[4]  Mei-xian Song,et al.  Metaheuristics for solving the vehicle routing problem with the time windows and energy consumption in cold chain logistics , 2020, Appl. Soft Comput..

[5]  Junqing Li,et al.  An Efficient Optimization Algorithm for Resource-Constrained Steelmaking Scheduling Problems , 2018, IEEE Access.

[6]  James C. Chen,et al.  Flexible job shop scheduling with parallel machines using Genetic Algorithm and Grouping Genetic Algorithm , 2012, Expert Syst. Appl..

[7]  Rubén Ruiz,et al.  A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility , 2006, European Journal of Operational Research.

[8]  Jun-qing Li,et al.  A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system , 2019, Cluster Computing.

[9]  Ewa Figielska,et al.  A heuristic for scheduling in a two-stage hybrid flowshop with renewable resources shared among the stages , 2014, Eur. J. Oper. Res..

[10]  Bertrand M. T. Lin,et al.  Resource-constrained flowshop scheduling with separate resource recycling operations , 2012, Comput. Oper. Res..

[11]  Jun-Lin Lin,et al.  Interaction Enhanced Imperialist Competitive Algorithms , 2012, Algorithms.

[12]  Maurizio Faccio,et al.  Simulated annealing approach to solve dual resource constrained job shop scheduling problems: layout impact analysis on solution quality , 2015, Int. J. Math. Oper. Res..

[13]  Yuyan Han,et al.  An improved Jaya algorithm for solving the flexible job shop scheduling problem with transportation and setup times , 2020, Knowl. Based Syst..

[14]  Felix T.S. Chan,et al.  Flexible job-shop scheduling problem under resource constraints , 2006 .

[15]  Zahra Nasiri-Gheidari,et al.  Application of an imperialist competitive algorithm to the design of a linear induction motor , 2010 .

[16]  Fariborz Jolai,et al.  A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop , 2013 .

[17]  Tom Page,et al.  A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints , 2011 .

[18]  Ajith Abraham,et al.  Using imperialist competition algorithm for independent task scheduling in grid computing , 2014, J. Intell. Fuzzy Syst..

[19]  Peng Duan,et al.  Efficient multi-objective algorithm for the lot-streaming hybrid flowshop with variable sub-lots , 2020, Swarm Evol. Comput..

[20]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[21]  Taher Niknam,et al.  An efficient hybrid algorithm based on modified imperialist competitive algorithm and K-means for data clustering , 2011, Eng. Appl. Artif. Intell..

[22]  Yiping Liu,et al.  Meta-heuristic algorithm for solving vehicle routing problems with time windows and synchronized visit constraints in prefabricated systems , 2020 .

[23]  Stéphane Dauzère-Pérès,et al.  Metaheuristics for the job-shop scheduling problem with machine availability constraints , 2018, Comput. Ind. Eng..

[24]  Deming Lei,et al.  An effective neighborhood search for scheduling in dual-resource constrained interval job shop with environmental objective , 2015 .

[25]  Mostafa Zandieh,et al.  Flexible job shop scheduling under condition-based maintenance: Improved version of imperialist competitive algorithm , 2017, Appl. Soft Comput..

[26]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[27]  Deming Lei,et al.  Variable neighbourhood search for dual-resource constrained flexible job shop scheduling , 2014 .

[28]  Sou-Sen Leu,et al.  Ga-based resource-constrained flow-shop scheduling model for mixed precast production , 2002 .

[29]  Xionghui Zhou,et al.  A novel approach based on Neo4j for multi-constrained flexible job shop scheduling problem , 2019, Comput. Ind. Eng..

[30]  Ling Wang,et al.  A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem , 2016 .

[31]  Zsolt Tuza,et al.  Restricted assignment scheduling with resource constraints , 2019, Theor. Comput. Sci..

[32]  Mohammad Mohammadi,et al.  Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm , 2017 .

[33]  Jian Xiong,et al.  Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns , 2013 .

[34]  Liang Gao,et al.  A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem , 2016, Inf. Sci..

[35]  Bahman Naderi,et al.  A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times , 2014 .

[36]  Jingyao Li,et al.  A branch population genetic algorithm for dual-resource constrained job shop scheduling problem , 2016, Comput. Ind. Eng..

[37]  Jing Zhang,et al.  A hybrid discrete particle swarm optimization for dual-resource constrained job shop scheduling with resource flexibility , 2017, J. Intell. Manuf..

[38]  Ling Wang,et al.  A Two-Phase Meta-Heuristic for Multiobjective Flexible Job Shop Scheduling Problem With Total Energy Consumption Threshold , 2019, IEEE Transactions on Cybernetics.

[39]  Sadjad Mohammadi,et al.  Determination of the optimum cut-off grades and production scheduling in multi-product open pit mines using imperialist competitive algorithm (ICA) , 2017 .

[40]  Shinji Hasebe,et al.  A decentralized scheduling method for flowshop problems with resource constraints , 2004 .

[41]  Danping Lin,et al.  Multi-level genetic algorithm for the resource-constrained re-entrant scheduling problem in the flow shop , 2013, Eng. Appl. Artif. Intell..