Skip to main content
SpringerLink
Log in

A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown

  • General Paper
  • Published:
Journal of the Operational Research Society

Abstract

As the research interest in distributed scheduling is growing, distributed permutation flowshop scheduling problems (DPFSPs) have recently attracted an increasing attention. This paper presents a fuzzy logic-based hybrid estimation of distribution algorithm (FL-HEDA) to address DPFSPs under machine breakdown with makespan criterion. In order to explore more promising search space, FL-HEDA hybridises the probabilistic model of estimation of distribution algorithm with crossover and mutation operators of genetic algorithm to produce new offspring. In the FL-HEDA, a novel fuzzy logic-based adaptive evolution strategy (FL-AES) is adopted to preserve the population diversity by dynamically adjusting the ratio of offspring generated by the probabilistic model. Moreover, a discrete-event simulator that models the production process under machine breakdown is applied to evaluate expected makespan of offspring individuals. The simulation results show the effectiveness of FL-HEDA in solving DPFSPs under machine breakdown.

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

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

Similar content being viewed by others

References

  • Adibi MA, Zandieh M and Amiri M (2010). Multi-objective scheduling of dynamic job shop using variable neighborhood search. Expert Systems with Applications 37 (1): 282–287.

    Article  Google Scholar 

  • Aytug H, Lawley MA, McKay K, Mohan S and Uzsoy R (2005). Executing production schedules in the face of uncertainties: A review and some future directions. European Journal of Operational Research 161 (1): 86–110.

    Article  Google Scholar 

  • Ceberio J, Irurozki E, Mendiburu A and Lozano JA (2014). A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. Evolutionary Computation, IEEE Transactions 18 (2): 286–300.

    Article  Google Scholar 

  • Chamnanlor C, Sethanan K, Chien CF and Gen M (2014). Re-entrant flow shop scheduling problem with time windows using hybrid genetic algorithm based on auto-tuning strategy. International Journal of Production Research 52 (9): 2612–2629.

    Article  Google Scholar 

  • Chan FT, Prakash A, Ma HL and Wong CS (2013). A hybrid tabu sample-sort simulated annealing approach for solving distributed scheduling problem. International Journal of Production Research 51 (9): 2602–2619.

    Article  Google Scholar 

  • Chan FT, Prakash A and Mishra N (2013). Priority-based scheduling in flexible system using AIS with FLC approach. International Journal of Production Research 51 (16): 4880–4895.

    Article  Google Scholar 

  • Chan HK and Chung SH (2013). Optimisation approaches for distributed scheduling problems. International Journal of Production Research 51 (9): 2571–2577.

    Article  Google Scholar 

  • Chang PC, Chen SS and Fan CY (2008). Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems. Applied Soft Computing 8 (1): 767–777.

    Article  Google Scholar 

  • Chen WJ (2006). Minimizing total flow time in the single-machine scheduling problem with periodic maintenance. Journal of the Operational Research Society 57 (4): 410–415.

    Article  Google Scholar 

  • Chen YM, Chen MC, Chang PC and Chen SH (2012). Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems. Computers & Industrial Engineering 62 (2): 536–545.

    Article  Google Scholar 

  • Chen SH and Chen MC (2013). Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems. International Journal of Production Economics 141 (1): 24–33.

    Article  Google Scholar 

  • De Giovanni L and Pezzella F (2010). An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. European journal of operational research 200 (2): 395–408.

    Article  Google Scholar 

  • Gao J and Chen R (2011). A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem. International Journal of Computational Intelligence Systems 4 (4): 497–508.

    Article  Google Scholar 

  • Gao J, Chen R and Deng W (2013). An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem. International Journal of Production Research 51 (3): 641–651.

    Article  Google Scholar 

  • Garey MR, Johnson DS and Sethi R (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research 1 (2): 117–129.

    Article  Google Scholar 

  • Hatami S, Ruiz R and Andrés-Romano C (2013). The distributed assembly permutation flowshop scheduling problem. International Journal of Production Research 51 (17): 5292–5308.

    Article  Google Scholar 

  • Jarboui B, Eddaly M and Siarry P (2009). An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Computers & Operations Research 36 (9): 2638–2646.

    Article  Google Scholar 

  • Jeong SJ, Kim KS and Lee YH (2009). The efficient search method of simulated annealing using fuzzy logic controller. Expert Systems with Applications 36 (3): 7099–7103.

    Article  Google Scholar 

  • Kim KW, Gen M and Yamazaki G (2003). Hybrid genetic algorithm with fuzzy logic for resource-constrained project scheduling. Applied Soft Computing 2 (3): 174–188.

    Article  Google Scholar 

  • Kim K, Yun Y, Yoon J, Gen M and Yamazaki G (2005). Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling. Computers in Industry 56 (2): 143–160.

    Article  Google Scholar 

  • Leitão P (2009). Agent-based distributed manufacturing control: A state-of-the-art survey. Engineering Applications of Artificial Intelligence 22 (7): 979–991.

    Article  Google Scholar 

  • Lin SW, Ying KC and Huang CY (2013). Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. International Journal of Production Research 51 (16): 5029–5038.

    Article  Google Scholar 

  • Liu H, Gao L and Pan Q (2011). A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem. Expert Systems with Applications 38 (4): 4348–4360.

    Article  Google Scholar 

  • Luo H, Du B, Huang GQ, Chen H and Li X (2013). Hybrid flow shop scheduling considering machine electricity consumption cost. International Journal of Production Economics 146 (2): 423–439.

    Article  Google Scholar 

  • Luo H, Huang GQ, Shi Y, Qu T and Zhang YF (2012). Hybrid flowshop scheduling with family setup time and inconsistent family formation. International Journal of Production Research 50 (6): 1457–1475.

    Article  Google Scholar 

  • Macías-Escrivá FD, Haber R, del Toro R and Hernandez V (2013). Self-adaptive systems: A survey of current approaches, research challenges and applications. Expert Systems with Applications 40 (18): 7267–7279.

    Article  Google Scholar 

  • Mühlenbein H and Paass G (1996). From recombination of genes to the estimation of distributions I: Binary parameters. Lecture Notes in Computer Science 1141: 178–187, http://link.springer.com/chapter/10.1007/3-540-61723-X_982.

    Article  Google Scholar 

  • Naderi B, Zandieh M, Khaleghi Ghoshe Balagh A and Roshanaei V (2009). An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications 36 (6): 9625–9633.

    Article  Google Scholar 

  • Naderi B and Ruiz R (2010). The distributed permutation flowshop scheduling problem. Computers & Operations Research 37 (4): 754–768.

    Article  Google Scholar 

  • Naderi B and Azab A (2014). Modeling and heuristics for scheduling of distributed job shops. Expert Systems with Applications 41 (17): 7754–7763.

    Article  Google Scholar 

  • Ouelhadj D and Petrovic S (2009). A survey of dynamic scheduling in manufacturing systems. Journal of Scheduling 12 (4): 417–431.

    Article  Google Scholar 

  • Pan QK and Ruiz R (2012). An estimation of distribution algorithm for lot-streaming flowshop problems with setup times. Omega 40 (2): 166–180.

    Article  Google Scholar 

  • Qin H, Zhang Z, Qi Z and Lim A (2014). The freight consolidation and containerization problem. European Journal of Operational Research 234 (1): 37–48.

    Article  Google Scholar 

  • Shen JN, Wang L and Wang SY (2015). A bi-population EDA for solving the no-idle permutation flow-shop scheduling problem with the total tardiness criterion. Knowledge-Based Systems 74: 167–175, http://www.sciencedirect.com/science/article/pii/S095070511400416X.

    Article  Google Scholar 

  • Taguchi G (1986). Introduction to Quality Engineering. Asian Productivity Organization: Tokyo.

    Google Scholar 

  • Tasgetiren MF, Liang YC, Sevkli M and Gencyilmaz G (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. European Journal of Operational Research 177 (3): 1930–1947.

    Article  Google Scholar 

  • Tzeng YR, Chen CL and Chen CL (2012). A hybrid EDA with ACS for solving permutation flowshop scheduling. The International Journal of Advanced Manufacturing Technology 60 (9–12): 1139–1147.

    Article  Google Scholar 

  • Valdez F, Melin P and Castillo O (2011). An improved evolutionary method with fuzzy logic for combining particle swarm optimization and genetic algorithms. Applied Soft Computing 11 (2): 2625–2632.

    Article  Google Scholar 

  • Valdez F, Melin P and Castillo O (2014). A survey on nature-inspired optimization algorithms with fuzzy logic for dynamic parameter adaptation. Expert Systems with Applications 41 (14): 6459–6466.

    Article  Google Scholar 

  • Wang K and Choi SH (2012). A decomposition-based approach to flexible flowshop scheduling under machine breakdown. International Journal of Production Research 50 (1): 215–234.

    Article  Google Scholar 

  • Wang K and Choi SH (2014). A holonic approach to flexible flowshop scheduling under stochastic processing times. Computers & Operations Research 43: 157–168, http://www.sciencedirect.com/science/article/pii/S0305054813002839.

    Article  Google Scholar 

  • Wang L, Fang C, Suganthan PN and Liu M (2014). Solving system-level synthesis problem by a multi-objective estimation of distribution algorithm. Expert Systems with Applications 41 (5): 2496–2513.

    Article  Google Scholar 

  • Wang L, Wang SY and Xu Y (2012). An effective hybrid EDA-based algorithm for solving multidimensional knapsack problem. Expert Systems with Applications 39 (5): 5593–5599.

    Article  Google Scholar 

  • Wang K, Choi SH, Qin H and Huang Y (2013a). A cluster-based scheduling model using SPT and SA for dynamic hybrid flow shop problems. The International Journal of Advanced Manufacturing Technology 67 (9–12): 2243–2258.

    Article  Google Scholar 

  • Wang L, Wang S and Liu M (2013b). A Pareto-based estimation of distribution algorithm for the multi-objective flexible job-shop scheduling problem. International Journal of Production Research 51 (12): 3574–3592.

    Article  Google Scholar 

  • Wang SY, Wang L, Liu M and Xu Y (2013c). An effective estimation of distribution algorithm for solving the distributed permutation flowshop scheduling problem. International Journal of Production Economics 145 (1): 387–396.

    Article  Google Scholar 

  • Wang SY, Wang L, Liu M and Xu Y (2013d). An enhanced estimation of distribution algorithm for solving hybrid flow-shop scheduling problem with identical parallel machines. The International Journal of Advanced Manufacturing Technology 68 (9–12): 2043–2056.

    Article  Google Scholar 

  • Xu Y, Wang L, Wang S and Liu M (2014). An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem. Engineering Optimization 46 (9): 1269–1283.

    Article  Google Scholar 

  • Yalaoui N, Ouazene Y, Yalaoui F, Amodeo L and Mahdi H (2013). Fuzzy-metaheuristic methods to solve a hybrid flow shop scheduling problem with pre-assignment. International Journal of Production Research 51 (12): 3609–3624.

    Article  Google Scholar 

  • Zadeh LA (1973). Outline of a new approach to the analysis of complex systems and decision processes. IEEE Transactions on Systems, Man and Cybernetics. SMC-3 (1): 28–44.

  • Zandieh M and Gholami M (2009). An immune algorithm for scheduling a hybrid flowshop with sequence-dependent setup times and machines with random breakdowns. International Journal of Production Research 47 (24): 6999–7027.

    Article  Google Scholar 

  • Zhang Z, Che O, Cheang B, Lim A and Qin H (2013). A memetic algorithm for the multiperiod vehicle routing problem with profit. European Journal of Operational Research 229 (3): 573–584.

    Article  Google Scholar 

  • Zhang L, Gao L and Li X (2013). A hybrid genetic algorithm and tabu search for a multi-objective dynamic job shop scheduling problem. International Journal of Production Research 51 (12): 3516–3531.

    Article  Google Scholar 

  • Zhang Y and Li X (2011). Estimation of distribution algorithm for permutation flowshops with total flowtime minimization. Computers & Industrial Engineering 60 (4): 706–718.

    Article  Google Scholar 

Download references

Acknowledgements

We would like to thank the anonymous referees for their constructive and pertinent comments. This research is partially supported by Key Program from National Natural Science Foundation of China (No. 71131004 and No. 71231007), National Science Foundation of China (No. 71301124), Humanities and Social Sciences Foundation of the Ministry of Education of China (No.13YJC630165), Fundamental Research Funds for the Central Universities (No.2012GSP026), Macau University of Science and Technology (No. 0237), and Macau Science and Technology Development Fund (No. 066/2013/A2).

Author information

Authors and Affiliations

  1. Economics and Management School,Wuhan University, Wuhan, China

    Kai Wang

  2. School of Business, Macau University of Science and Technology, Macau, China

    Yun Huang

  3. School of Management, Huazhong University of Science and Technology, Wuhan, China

    Hu Qin

Authors
  1. Kai Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yun Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hu Qin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yun Huang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, K., Huang, Y. & Qin, H. A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown. J Oper Res Soc 67, 68–82 (2016). https://doi.org/10.1057/jors.2015.50

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1057/jors.2015.50

Keywords

Search

Navigation