Skip to main content

Advertisement

SpringerLink
Log in

A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

In this paper, a multi-objective hybrid flowshop rescheduling problem with respect to the production efficiency and instability is addressed in a dynamic shop environment, where two types of real-time events are simultaneously considered, i.e., machine breakdown and job cancelation. To solve the problem, a multi-objective migrating birds optimization (MMBO) is proposed. In the proposed algorithm, each solution is evaluated based on the Pareto dominance relationship, and an improvement procedure is further designed to help improve the solutions quality. The fast non-dominated sorting technique is introduced to sequence the solutions in the V-shaped population. For the leader evolution, it is conducted by a Pareto-based local search method, and within the process two neighbors sets are produced to, respectively, participate in the followers evolution in the two lines. For the followers evolution, the reproduction process is introduced and the benefit mechanism is implemented by combing the genetic operators. And in the two lines, different genetic operators are employed to achieve their collaboration. For the leader change, only the promising solutions can be forwarded to the leader position. A shuffling process is proposed to help share evolutionary information between the two lines and promote their joint efforts. The performance of the MMBO is evaluated by comparing with several state-of-the-art evolutionary multi-objective optimizers, and the computational results demonstrate the effectiveness of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  • Alkaya AF, Algin R (2015) Metaheuristic based solution approaches for the obstacle neutralization problem. Expert Syst Appl 42(3):1094–1105

    Article  Google Scholar 

  • Brah SA (1996) A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Prod Plan Control 7(4):362–373

    Article  Google Scholar 

  • Brah SA, Hunsucker JL (1991) Branch and bound algorithm for the flow shop with multiple processors. Eur J Oper Res 51(1):88–99

    Article  MATH  Google Scholar 

  • Carlier J, Néron E (2000) An exact method for solving the multi-processor flow-shop. Rairo-Oper Res 34(1):1–25

    Article  MathSciNet  MATH  Google Scholar 

  • Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Trans Evol Comput 18(4):577–601

    Article  Google Scholar 

  • Deb K, Pratap A, Agarwal S, Meyarivan TAMT (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  • Duman E, Uysal M, Alkaya AF (2012) Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem. Inf Sci 217:65–77

    Article  MathSciNet  Google Scholar 

  • Eusuff M, Lansey K, Pasha F (2006) Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Eng Optim 38(2):129–154

    Article  MathSciNet  Google Scholar 

  • Fang J, Xi Y (1997) A rolling horizon job shop rescheduling strategy in the dynamic environment. Int J Adv Manuf Technol 13(3):227–232

    Article  Google Scholar 

  • Gao L, Pan QK (2016) A shuffled multi-swarm micro-migrating birds optimizer for a multi-resource-constrained flexible job shop scheduling problem. Inf Sci 372:655–676

    Article  Google Scholar 

  • Gen M, Lin L (2014) Multiobjective evolutionary algorithm for manufacturing scheduling problems: state-of-the-art survey. J Intell Manuf 25:849–866

    Article  Google Scholar 

  • Grabowski J, Pempera J (2000) Sequencing of jobs in some production system. Eur J Oper Res 125(3):535–550

    Article  MathSciNet  MATH  Google Scholar 

  • Guinet AGP, Solomon MM (1996) Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time. Int J Prod Res 34(6):1643–1654

    Article  MATH  Google Scholar 

  • Guo W, Chen M, Wang L, Wu Q (2017) Hyper multi-objective evolutionary algorithm for multi-objective optimization problems. Soft Comput 21(20):5883–5891

    Article  Google Scholar 

  • Gupta JN (1988) Two-stage, hybrid flowshop scheduling problem. J Oper Res Soc 359–364

  • Jiang S, Liu M, Hao J, Qian W (2015) A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry. Comput Ind Eng 87:518–531

    Article  Google Scholar 

  • Khalouli S, Ghedjati F, Hamzaoui A (2010) A meta-heuristic approach to solve a JIT scheduling problem in hybrid flow shop. Eng Appl Artif Intell 23(5):765–771

    Article  Google Scholar 

  • Li JQ, Pan QK, Gao KZ (2011) Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems. Int J Adv Manuf Technol 55(9):1159–1169

    Article  Google Scholar 

  • Li JQ, Pan QK, Mao K (2016) A hybrid fruit fly optimization algorithm for the realistic hybrid flowshop rescheduling problem in steelmaking systems. IEEE Trans Autom Sci Eng 13(2):932–949

    Article  Google Scholar 

  • Lin HT, Liao CJ (2003) A case study in a two-stage hybrid flow shop with setup time and dedicated machines. Int J Prod Econ 86(2):133–143

    Article  Google Scholar 

  • Long J, Zheng Z, Gao X (2017) Dynamic scheduling in steelmaking-continuous casting production for continuous caster breakdown. Int J Prod Res 55(11):3197–3216

    Article  Google Scholar 

  • Lu C, Gao L, Li X, Xiao S (2017) A hybrid multi-objective grey wolf optimizer for dynamic scheduling in a real-world welding industry. Eng Appl Artif Intell 57:61–79

    Article  Google Scholar 

  • Lu C, Gao L, Li X, Zheng J, Gong W (2018) A multi-objective approach to welding shop scheduling for makespan, noise pollution and energy consumption. J Clean Prod 196:773–787

    Article  Google Scholar 

  • Luo H, Huang GQ, Zhang Y, Dai Q, Chen X (2009) Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm. Robot Comput Integr Manuf 25(6):962–971

    Article  Google Scholar 

  • Marinakis Y, Marinaki M (2013) Particle swarm optimization with expanding neighborhood topology for the permutation flowshop scheduling problem. Soft Comput 17(7):1159–1173

    Article  MATH  Google Scholar 

  • Meng T, Pan QK, Li JQ, Sang HY (2018) An improved migrating birds optimization for an integrated lot-streaming flow shop scheduling problem. Swarm Evol Comput 38:64–78

    Article  Google Scholar 

  • Naderi B, Zandieh M, Roshanaei V (2009) Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness. Int J Adv Manuf Technol 41(11–12):1186–1198

    Article  Google Scholar 

  • Naderi B, Ruiz R, Zandieh M (2010) Algorithms for a realistic variant of flowshop scheduling. Comput Oper Res 37(2):236–246

    Article  MathSciNet  MATH  Google Scholar 

  • Néron E, Baptiste P, Gupta JN (2001) Solving hybrid flow shop problem using energetic reasoning and global operations. Omega Int J Manag Sci 29(6):501–511

    Article  Google Scholar 

  • Niroomand S, Hadi-Vencheh A, Şahin R, Vizvári B (2015) Modified migrating birds optimization algorithm for closed loop layout with exact distances in flexible manufacturing systems. Expert Syst Appl 42(19):6586–6597

    Article  Google Scholar 

  • Ouelhadj D, Petrovic S (2009) A survey of dynamic scheduling in manufacturing systems. J Sched 12(4):417–431

    Article  MathSciNet  MATH  Google Scholar 

  • Oz D (2017) An improvement on the migrating birds optimization with a problem-specific neighboring function for the multi-objective task allocation problem. Expert Syst Appl 67:304–311

    Article  Google Scholar 

  • Pan QK (2016) An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling. Eur J Oper Res 250(3):702–714

    Article  MathSciNet  MATH  Google Scholar 

  • Pan QK, Dong Y (2014) An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation. Inf Sci 277(2):643–655

    Article  MathSciNet  MATH  Google Scholar 

  • Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181(12):2455–2468

    Article  MathSciNet  Google Scholar 

  • Pan QK, Wang L, Li JQ, Duan JH (2014) A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation. Omega Int J Manag Sci 45:42–56

    Article  Google Scholar 

  • Peng K, Pan QK, Gao L, Zhang B, Pang X (2018) An improved artificial bee colony algorithm for real-world hybrid flowshop rescheduling in steelmaking-refining continuous casting process. Comput Ind Eng 122:235–250

    Article  Google Scholar 

  • Ruiz R, Maroto C (2006) A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. Eur J Oper Res 169(3):781–800

    Article  MathSciNet  MATH  Google Scholar 

  • Ruiz R, Vázquez-Rodríguez JA (2010) The hybrid flow shop scheduling problem. Eur J Oper Res 205(1):1–18

    Article  MathSciNet  MATH  Google Scholar 

  • Sabuncuoglu I, Karabuk S (1999) Rescheduling frequency in an FMS with uncertain processing times and unreliable machines. J Manuf Syst 18(4):268

    Article  Google Scholar 

  • Shen X-N, Yao X (2015) Mathematical modeling and multi-objective evolutionary algorithms applied to dynamic flexible job shop scheduling problems. Inf Sci 298:198–224

    Article  MathSciNet  Google Scholar 

  • Sioud A, Gagné C (2018) Enhanced migrating birds optimization algorithm for the permutation flow shop problem with sequence dependent setup times. Eur J Oper Res 264(1):66–73

    Article  MathSciNet  MATH  Google Scholar 

  • Soto R, Crawford B, Almonacid B, Paredes F (2016) Efficient parallel sorting for migrating birds optimization when solving machine-part cell formation problems. Sci Program 2016(4):21

    Google Scholar 

  • Suresh V, Chaudhuri D (1993) Dynamic scheduling—a survey of research. Int J Prod Econ 32(1):53–63

    Article  Google Scholar 

  • Tang L, Zhao Y, Liu J (2014) An improved differential evolution algorithm for practical dynamic scheduling in steelmaking-continuous casting production. IEEE Trans Evol Comput 18(2):209–225

    Article  Google Scholar 

  • Tripathi PK, Bandyopadhyay S, Pal SK (2007) Multi-objective particle swarm optimization with time variant inertia and acceleration coefficients. Inf Sci 177(22):5033–5049

    Article  MathSciNet  MATH  Google Scholar 

  • Vieira GE, Herrmann JW, Lin E (2003) Rescheduling manufacturing systems: a framework of strategies, policies, and methods. J Sched 6(1):39–62

    Article  MathSciNet  MATH  Google Scholar 

  • Wang DJ, Liu F, Wang JJ, Wang YZ (2016) Integrated rescheduling and preventive maintenance for arrival of new jobs through evolutionary multi-objective optimization. Soft Comput 20(4):1635–1652

    Article  MATH  Google Scholar 

  • Wang H, Fu Y, Huang M, Huang G, Wang J (2017) A hybrid evolutionary algorithm with adaptive multi-population strategy for multi-objective optimization problems. Soft Comput 21(20):5975–5987

    Article  Google Scholar 

  • Wittrock RJ (1988) An adaptable scheduling algorithm for flexible flow lines. Oper Res 36(3):445–453

    Article  MATH  Google Scholar 

  • Xia W, Wu Z (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Comput Ind Eng 48(2):409–425

    Article  Google Scholar 

  • Yang XS (2011) Bat algorithm for multi-objective optimisation. Int J Bio-Inspired Comput 3(5):267–274

    Article  Google Scholar 

  • Yang K, Zhang Z, Lu J (2018) Adaptive racing ranking-based immune optimization approach solving multi-objective expected value programming. Soft Comput 22(7):2139–2158

    Article  MATH  Google Scholar 

  • Zandieh M, Gholami M (2009) An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns. Int J Prod Res 47(24):6999–7027

    Article  MATH  Google Scholar 

  • Zhang Q, Li H (2007) MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712–731

    Article  Google Scholar 

  • Zhang B, Pan QK, Gao L, Zhang XL, Sang HY, Li JQ (2017a) An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming. Appl Soft Comput 52:14–27

    Article  Google Scholar 

  • Zhang R, Chang PC, Song S, Wu C (2017b) A multi-objective artificial bee colony algorithm for parallel batch-processing machine scheduling in fabric dyeing processes. Knowl Based Syst 116:114–129

    Article  Google Scholar 

  • Zitzler E, Laumanns M, Thiele L (2001) SPEA2: improving the strength pareto evolutionary algorithm evolutionary methods for design, optimization and control with applications to industrial problems. Citeseer, Athens, pp 95–100

    Google Scholar 

Download references

Acknowledgements

The research is supported by the National Natural Science Foundation of China (51575212, 51775216), College Science and Technology Program Project of Shandong Province (J13LI10), Natural Science Foundation of Hubei Province (2018CFA078), and Open Research Fund Program of the State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, China.

Author information

Authors and Affiliations

  1. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science & Technology, Wuhan, 430074, People’s Republic of China

    Biao Zhang, Quan-ke Pan, Liang Gao & Kun-kun Peng

  2. College of Mathematic Science, Liaocheng University, Liaocheng, 25200, People’s Republic of China

    Xin-li Zhang

Authors
  1. Biao Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Quan-ke Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Liang Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Xin-li Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Kun-kun Peng
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Quan-ke Pan.

Ethics declarations

Conflict of interest

The authors declared that they have no conflict of interest.

Additional information

Communicated by V. Loia.

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, B., Pan, Qk., Gao, L. et al. A multi-objective migrating birds optimization algorithm for the hybrid flowshop rescheduling problem. Soft Comput 23, 8101–8129 (2019). https://doi.org/10.1007/s00500-018-3447-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-018-3447-8

Keywords

Search

Navigation