Skip to main content
SpringerLink
Log in

A hybrid estimation of distribution algorithm for flexible job-shop scheduling problems with process plan flexibility

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

The flexible job-shop environments have become increasingly significant because of rapid improvements on shop floors such as production technologies, manufacturing processes and systems. Several real manufacturing and service companies have had to use alternative machines or processes for each operation and the availability of alternative process plans for each job in order to achieve good performance on the shop floor where conflicting objectives are common, e.g. the overall completion time for all jobs and the workload of the most loaded machine. In this paper, we propose a Pareto approach based on the hybridization of an estimation of distribution algorithm and the Mallows distribution in order to build better sequences for flexible job-shop scheduling problems with process plan flexibility and to solve conflicting objectives. This hybrid approach exploits the Pareto-front information used as an input parameter in the Mallows distribution. Various instances and numerical experiments are presented to illustrate that shop floor performance can be noticeably improved using the proposed approach. In addition, statistical tests are executed to validate this novel research.

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
Fig. 14
Fig. 15
Fig. 16
Fig. 17

Similar content being viewed by others

References

  1. Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34(3):391–401

    Article  MathSciNet  MATH  Google Scholar 

  2. Ali A, Meilă M (2012) Experiments with Kemeny ranking: what works when?. Math Soc Sci 64(1):28–40

    Article  MathSciNet  MATH  Google Scholar 

  3. Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149–156

    Article  MATH  Google Scholar 

  4. Barnes JW, Chambers JB (1996) Flexible job shop scheduling by tabu search. Graduate Program in Operations and Industrial Engineering, The University of Texas at Austin, Technical Report Series, ORP96-09

  5. Bartholdi J, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welf 6(2):157–165

    Article  MathSciNet  MATH  Google Scholar 

  6. Borda JD (1784) Mémoire sur les élections au scrutin, vol 1781. Histoire de l’Academie Royale des Sciences pour, Paris

    Google Scholar 

  7. Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41 (3):157–183

    Article  MATH  Google Scholar 

  8. Ceberio J, Irurozki E, Mendiburu A, Lozano JA (2014) A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem. IEEE Trans Evol Comput 18(2):286–300

    Article  Google Scholar 

  9. Chambers JB, Barnes JW (1996) New tabu search results for the job shop scheduling problem. The University of Texas, Austin, Technical Report Series ORP96-06, Graduate Program in Operations Research and Industrial Engineering

  10. Chen SH, Chang PC, Cheng TCE, Zhang Q (2012) A self-guided genetic algorithm for permutation flowshop scheduling problems. Comput Oper Res 39(7):1450–1457

    Article  MathSciNet  MATH  Google Scholar 

  11. Chen SH, Chen MC, Chang PC, Zhang Q, Chen YM (2010) Guidelines for developing effective estimation of distribution algorithms in solving single machine scheduling problems. Expert Syst Appl 37(9):6441–6451

    Article  Google Scholar 

  12. Chen YM, Chen MC, Chang PC, Chen SH (2012) Extended artificial chromosomes genetic algorithm for permutation flowshop scheduling problems. Comput Ind Eng 62(2):536–545

    Article  Google Scholar 

  13. Cohen WW, Schapire RE, Singer Y (1998) Learning to order things. J Artif Intell Res 10:243–270

    Article  MathSciNet  MATH  Google Scholar 

  14. Dauod H, Li D, Yoon SW, Srihari K (2016) Multi-objective optimization of the order scheduling problem in mail-order pharmacy automation systems. Int J Adv Manuf Technol:1–11, https://doi.org/10.1007/s00170-016-9123-1

  15. 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 

  16. Fattahi P, Mehrabad MS, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331

    Article  Google Scholar 

  17. Fisher H, Thompson GL (1963) Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF, Thompson GL (eds) Industrial Scheduling. Prentice Hall, Englewood Cliffs, pp 225–251

  18. Fligner MA, Verducci JS (1986) Distance based ranking models. J R Stat Soc Ser B Methodol 48(3):359–369. http://www.jstor.org/stable/2345433

  19. Fligner MA, Verducci JS (1988) Multistage ranking models. J Amer Stat Assoc 83(403):892–901

    Article  MathSciNet  MATH  Google Scholar 

  20. Gao J, Sun L, Gen M (2008) A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems. Comput Oper Res 35(9):2892–2907

    Article  MathSciNet  MATH  Google Scholar 

  21. Gen M, Tsujimura Y, Kubota E (1994) Solving job-shop scheduling problems by genetic algorithm. In: 1994 IEEE International Conference on Systems, Man, and Cybernetics, 1994. Humans, Information and Technology, vol 2. IEEE, pp 1577–1582

  22. Greenwood AG, Vanguri S, Eksioglu B, Jain P, Hill TW, Miller JW, Walden CT (2005) Simulation optimization decision support system for ship panel shop operations. In: Proceedings of the 37th conference on Winter simulation. Winter Simulation Conference, pp 2078–2086

  23. Huang S, Tian N, Wang Y, Ji Z (2016) Multi-objective flexible job-shop scheduling problem using modified discrete particle swarm optimization. SpringerPlus 5(1):1432

    Article  Google Scholar 

  24. Irurozki E, Calvo B, Lozano JA (2014) Sampling and learning Mallows and Generalized Mallows models under the Cayley distance. Methodol Comput Appl Probab 20(1):1–35. https://doi.org/10.1007/s11009-016-9506-7

  25. Jarboui B, Eddaly M, Siarry P (2009) An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems. Comput Oper Res 36(9):2638–2646

    Article  MathSciNet  MATH  Google Scholar 

  26. Kacem I, Hammadi S, Borne P (2002) Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic. Math Comput Simul 60(3):245–276

    Article  MathSciNet  MATH  Google Scholar 

  27. Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol 1000, p IV

  28. Kim YK, Park K, Ko J (2003) A symbiotic evolutionary algorithm for the integration of process planning and job shop scheduling. Comput Oper Res 30(8):1151–1171

    Article  MathSciNet  MATH  Google Scholar 

  29. Larrañaga P, Lozano JA (eds) (2001) Estimation of distribution algorithms: a new tool for evolutionary computation, vol 2. Springer Science and Business Media, Berlin

    Google Scholar 

  30. Lawrence S (1984) Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (supplement). Graduate School of Industrial Administration. Carnegie-Mellon University, Pittsburgh

    Google Scholar 

  31. Lee YH, Jeong CS, Moon C (2002) Advanced planning and scheduling with outsourcing in manufacturing supply chain. Comput Ind Eng 43(1):351–374

    Article  Google Scholar 

  32. Li X, Gao L (2016) An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem. Int J Prod Econ 174:93–110

    Article  Google Scholar 

  33. Li X, Xing K, Wu Y, Wang X, Luo J (2017) Total energy consumption optimization via genetic algorithm in flexible manufacturing systems. Comput Ind Eng 104:188–200

    Article  Google Scholar 

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

    Article  Google Scholar 

  35. Mallows CL (1957) Non-null ranking models. I. Biometrika 44(1/2):114–130

    Article  MathSciNet  MATH  Google Scholar 

  36. Meilă M, Phadnis K, Patterson A, Bilmes J (2012) Consensus ranking under the exponential model. arXiv:1206.5265

  37. Meilă M, Phadnis K, Patterson A, Bilmes J (2007) Consensus ranking under the exponential model. In: Proceedings of the 22nd Conference Uncertainty and Artificial Intelligence, Vancouver, pp 285–294

  38. Mühlenbein H (1997) The equation for response to selection and its use for prediction. Evol Comput 5(3):303–346

    Article  Google Scholar 

  39. Mühlenbein H, Paaß G (1996) From recombination of genes to the estimation of distributions. I binary parameters. In: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature. Springer, Berlin, p 187

  40. Özgüven C, Özbakr L, Yavuz Y (2010) Mathematical models for job-shop scheduling problems with routing and process plan flexibility. Appl Math Modell 34(6):1539–1548

    Article  MathSciNet  MATH  Google Scholar 

  41. Özgüven C, Yavuz Y, Özbakr L (2012) Mixed integer goal programming models for the flexible job-shop scheduling problems with separable and non-separable sequence dependent setup times. Appl Math Modell 36(2):846–858

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  Google Scholar 

  43. Park BJ, Choi HR (2006) A genetic algorithm for integration of process planning and scheduling in a job shop. In: Australian conference on artificial intelligence, pp 647–657

  44. Peña JM, Robles V, Larranaga P, Herves V, Rosales F, Pérez MS (2004) GA-EDA: Hybrid evolutionary algorithm using genetic and estimation of distribution algorithms. In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems. Springer, Berlin, pp 361–371

  45. Phanden RK, Jain A (2015) Assessment of makespan performance for flexible process plans in job shop scheduling. IFAC-PapersOnLine 48(3):1948–1953

    Article  Google Scholar 

  46. Rossi A, Dini G (2007) Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimisation method. Robot Comput-Integr Manuf 23(5):503–516

    Article  Google Scholar 

  47. Srinivas N, Deb K (1994) Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evol Comput 2(3):221–248

    Article  Google Scholar 

  48. Storer RH, Wu SD, Vaccari R (1992) New search spaces for sequencing problems with application to job shop scheduling. Manag Sci 38(10):1495–1509

    Article  MATH  Google Scholar 

  49. Sundaram RM, Fu SS (1988) Process planning and scheduling. Comput Ind Eng 15:296–307

    Article  Google Scholar 

  50. Tan W (1998) Integration of process planning and scheduling-a mathematical programming approach. University of Southern California, USA

    Google Scholar 

  51. Wang L, Wang S, Xu Y, Zhou G, Liu M (2012) A bi-population based estimation of distribution algorithm for the flexible job-shop scheduling problem. Comput Ind Eng 62(4):917–926

    Article  Google Scholar 

  52. Wang K, Huang Y, Qin H (2016) A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown. J Oper Res Soc 67(1):68–82

    Article  Google Scholar 

  53. Xu H, Bao ZR, Zhang T (2017) Solving dual flexible job-shop scheduling problem using a Bat Algorithm. Adv Prod Eng Manag 12(1):5

    MathSciNet  Google Scholar 

  54. Yamada T, Nakano R (1992) A genetic algorithm applicable to large-scale job-shop problems. In: PPSN, vol 2, pp 281–290

  55. Yin L, Li X, Gao L, Lu C, Zhang Z (2017) A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem. Sustain Comput: Inform Syst 13:15–30

    Google Scholar 

  56. Yue L, Guan Z, Saif U, Zhang F, Wang H (2016) Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects. SpringerPlus 5(1):1593

    Article  Google Scholar 

  57. Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm

Download references

Acknowledgments

We would like to express our gratitude to all the reviewers for their comments in improving the manuscript.

Author information

Authors and Affiliations

  1. CONACYT - CIMAT A.C., Bartolomé de las Casas 314, Barrio la Estación, 20259, Aguascalientes, Ags, México

    Ricardo Pérez-Rodríguez

  2. CIMAT A.C., Jalisco s/n, Valenciana, 36240, Guanajuato, Gto, México

    Arturo Hernández-Aguirre

Authors
  1. Ricardo Pérez-Rodríguez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arturo Hernández-Aguirre
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ricardo Pérez-Rodríguez.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Pérez-Rodríguez, R., Hernández-Aguirre, A. A hybrid estimation of distribution algorithm for flexible job-shop scheduling problems with process plan flexibility. Appl Intell 48, 3707–3734 (2018). https://doi.org/10.1007/s10489-018-1160-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-018-1160-z

Keywords

Search

Navigation