Skip to main content
SpringerLink
Log in

A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system

  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

This work presents a multi-objective discrete firefly algorithm (MO-DFFA) for solving the flexible job-shop scheduling problem (FJSP) in a make-to-order production. Three different objectives are minimised simultaneously, being these objectives the weighted sum of the completion times of the orders, the workload of the critical machine and the total workload of all machines. Customer orders are ranked by priority according to the variables that the company considers the most relevant for its classification. Then, this priority is included in the FJSP model giving more preference in the scheduling phase to client requests with higher priority while, at the same, the volume of work of the resources is balanced to avoid machines saturation or under-utilization. With this approach both customer and company requirements can be satisfied and balanced. Furthermore, in the proposed framework customers can customize their orders choosing between some eligible product characteristics, which are considered as the different manufacturing operations which constitute each job. For solving the two sub-problems (i.e. operations assignment and sequencing) required for the scheduling of a flexible manufacturing system, we implemented a discrete version of the firefly algorithm metaheuristic. The computational results of several problem instances show that the presented MO-DFFA is a promising and efficient alternative to solve the FJSP in a customer-centric production system.

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

Similar content being viewed by others

References

  • Akbaripour H, Houshmand M, van Woensel T, Mutlu N (2018) Cloud manufacturing service selection optimization and scheduling with transportation consideration: mixed-integer programming models. Int J Adv Manuf Technol 95:43–70

    Article  Google Scholar 

  • Bagheri A, Zandieh M, Mahdavi I, Yazdani M (2010) An artificial immune algorithm for the flexible job-shop scheduling problem. Future Gener Comput Syst 26(4):533–541

    Article  Google Scholar 

  • Banati H, Bajaj M (2011) Fire fly based feature selection approach. Int J Comput Sci Issues 8(4):473–479

    Google Scholar 

  • Biskup D (1998) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173–178

    Article  Google Scholar 

  • Blum C, Roli A (2003) Meta-heuristics in combinatorial optimisation: overview and conceptual comparison. ACM Comput Surv 35(3):268–308

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Brettel M, Friederichsen N, Keller M, Rosenberg M (2014) How virtualization, decentralization and network building change the manufacturing landscape: an Industry 4.0 perspective. World Acad Sci Eng Technol Int J Mech Aerosp Ind Mech Manuf Eng 8:37–44

    Google Scholar 

  • Brucker P, Jurisch B, Sievers B (1994) A branch and bound algorithm for the job-shop scheduling problem. Discrete Appl Math 49:107–127

    Article  Google Scholar 

  • Brucker P (2001) Scheduling algorithms. Springer, Berlin

    Book  Google Scholar 

  • Cao Y, Wang S, Kang L, Gao Y (2016) A TQCS-based service selection and scheduling strategy in cloud manufacturing. Int J Adv Manuf Technol 82:235–251

    Article  Google Scholar 

  • Chatterjee A, Mahanti GK, Chatterjee A (2012) Design of a fully digital controlled reconfigurable switched beam concentric ring array antenna using firefly and particle swarm optimization algorithm. Prog Electromagn Res B 36:113–131

    Article  Google Scholar 

  • Chen CL, Vempati VS, Aljaber N (1995) An application of genetic algorithms for flow shop problems. Eur J Oper Res 80(2):389–396

    Article  Google Scholar 

  • Dauzère-Pérès S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281–306

    Article  Google Scholar 

  • De Giovanni L, Pezzella F (2010) An improved genetic algorithm for the distributed and flexible job-shop scheduling problem. Eur J Oper Res 200(2):395–408

    Article  Google Scholar 

  • De Paula MR, Ravetti MG, Mateus GR, Pardalos PM (2007) Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighbourhood search. IMA J Manag Math 18(2):101–115

    Article  Google Scholar 

  • Du X, Li Z, Xiong W (2008) Flexible Job shop scheduling problem solving based on genetic algorithm with model constraints. In: IEEE international conference on industrial engineering and engineering management (IEEM 2008), pp 1239–1243

  • Fattahi P, Saidi-Mehrabad M, Jolai F (2007) Mathematical modeling and heuristic approaches to flexible job shop scheduling problems. J Intell Manuf 18(3):331–342

    Article  Google Scholar 

  • Garey MR, Johnson DS, Sethi R (1976) The complexity of flowshop and jobshop scheduling. Math Oper Res 1(2):97–196

    Article  Google Scholar 

  • Gonçalves JF, Mendes JJM, Resende MGC (2005) A hybrid genetic algorithm for the job shop scheduling problem. Eur J Oper Res 167(1):77–95

    Article  Google Scholar 

  • Graves SC (1981) A review of production scheduling. Oper Res 29(4):646–675

    Article  Google Scholar 

  • Güçdemir H, Selim H (2017) Customer centric production planning and control in jobs shops: a simulation optimization approach. J Manuf Syst 43:100–116

    Article  Google Scholar 

  • Horng MH (2012) Vector quantization using the firefly algorithm for image compression. Expert Syst Appl 39(1):1078–1091

    Article  Google Scholar 

  • Hsu T, Dupas R, Jolly D, Goncalves G (2002) Evaluation of mutation heuristics for solving a multiobjective flexible job shop by an evolutionary algorithm. In: Proceeding of the IEEE international conference on systems, man and cybernetics, pp 655–660

  • Ivanov D, Dolgui A, Sokolov B, Werner F, Ivanova M (2016) A dynamic model and an algorithm for short-term supply chain scheduling in the smart factory industry 4.0. Int J Prod Res 54(2):386–402

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Kacem I, Hammadi S, Borne P (2002b) Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Trans Syst Man Cybern Part C (Appl Rev) 32(1):1–13

    Article  Google Scholar 

  • Karthikeyan S, Asokan P, Nickolas S (2014) A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints. Int J Adv Manuf Technol 72:1567–1579

    Article  Google Scholar 

  • Kuo WH, Yang DL (2006) Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect. Eur J Oper Res 174(2):1184–1190

    Article  Google Scholar 

  • Lawler EL, Lenstra K, Rinooy AHK, Shmoys DB (1993) Sequencing and scheduling: Algorithms and complexity. In: Graves SS, Rinnooykan AHG, Zipkin P (eds) Logistics of production and inventory. Handbooks in operations research and management science, vol 4. North-Holland Publishing Company, Amsterdam, pp 445–522

    Chapter  Google Scholar 

  • Lee CY (1991) Parallel machines scheduling with nonsimultaneous machine available time. Discrete Appl Math 30:53–61

    Article  Google Scholar 

  • Lohrer M (2013) A comparison between the firefly algorithm and particle swarm optimization. PhD thesis

  • Lunardi W, Voos H (2018) Comparative study of genetic and discrete firefly algorithm for combinatorial optimization. In: 33rd ACM/SIGAPP symposium on applied computing, At Pau, France. https://doi.org/10.1145/3167132.3167160

  • Mastrolilli M, Gambardella LM (2000) Effective neighbourhood functions for the flexible job shop problem. J Sched 3(1):3–20

    Article  Google Scholar 

  • Morinaga Y, Nagao M, Sano M (2014) Optimization of flexible job-shop scheduling with weighted tardiness and setup-worker load balance in make-to-order manufacturing. In: Joint 7th international conference on soft computing and intelligent systems (SCIS) and 15th international symposium on advanced intelligent systems (ISIS). https://doi.org/10.1109/scis-isis.2014.7044681

  • Moslehi G, Mahnam M (2011) A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search. Int J Prod Econ 129(1):14–22

    Article  Google Scholar 

  • Najid NM, Dauzere-Peres S, Zaidat A (2002) A modified simulated annealing method for flexible job shop scheduling problem. In: IEEE international conference of systems, man and cybernetics, vol 5

  • Nasser S, Ghasemishabankareh (2013) A novel hybrid meta-heuristic algorithm for solving multi objective flexible job shop scheduling. J Manuf Syst 32(4):771–780

    Article  Google Scholar 

  • Osman IH, Potts CN (1989) Simulated annealing for permutation flow-shop scheduling. Omega 17(6):551–557

    Article  Google Scholar 

  • Paulli J (1995) A hierarchical approach for the FMS scheduling problem. Eur J Oper Res 86(1):32–42

    Article  Google Scholar 

  • Pezzella F, Morganti G, Ciaschetti G (2008) A genetic algorithm for the Flexible Job-shop scheduling problem. J Comput Oper Res 35(10):3202–3212

    Article  Google Scholar 

  • Rajkumar M, Asokan P, Anilkumar N, Page T (2011) A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. Int J Prod Res 49:2409–2423

    Article  Google Scholar 

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

    Article  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  Google Scholar 

  • Senthilnath J, Omkar SN, Mani V (2011) Clustering using firefly algorithm: performance study. Swarm Evol Comput 1(3):164–171

    Article  Google Scholar 

  • Sha DY, Hsu CY (2006) A hybrid particle swarm optimization for job shop scheduling problem. Comput Ind Eng 51(4):791–808

    Article  Google Scholar 

  • Vaessens RJM, Aarts EHL, Lenstra JK (1994) Job shop scheduling by local search. COSOR Memorandum 94-05, Eindhoven University

  • Wang S, Wan J, Li D, Zhang C (2016a) Implementing smart factory of Industrie 4.0: an outlook. Int J Distrib Sens Netw 12(1):3159805

    Article  Google Scholar 

  • Wang S, Zhang C, Li D (2016b) A Big Data centric integrated framework and typical system configurations for smart factory. In: Wan J, Humar I, Zhang D (eds) Industrial IoT technologies and applications. Industrial IoT 2016. Lecture notes of the institute for computer sciences, social informatics and telecommunications engineering, vol 173. Springer, Cham, pp 12–23

  • Xing LN, Chen YW, Wang P, Zhao QS, Xiong J (2010) A knowledge-based ant colony optimization for flexible job shop scheduling problems. Appl Soft Comput 10:888–896

    Article  Google Scholar 

  • Yang XS (2008) Nature-inspired metaheuristic algorithm. Luniver Press, Bristol

    Google Scholar 

  • Yang XS (2009) Firefly algorithm for multimodal optimization. Stoch Algorithms Found Appl 5792:169–178

    Article  Google Scholar 

  • Yang XS (2010) Firefly algorithm, stochastic test functions and design optimization. Int J Bio Inspir Comput 2(2):78–84

    Article  Google Scholar 

  • Yao X, Zhang J, Li Y, Zhang C (2017) Towards flexible RFID event-driven integrated manufacturing for make-to-order production. Int J Comput Integr Manuf 31(10):1–15

    Google Scholar 

  • Zhang G, Shao X, Li P, Gao L (2009) An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Comput Ind Eng 56:1309–1318

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Business Management Department, Polytechnic School of Engineering of Gijón, University of Oviedo, C\ Wilfredo Ricart s/n, 33203, Gijón, Asturias, Spain

    Nicolás Álvarez-Gil, Rafael Rosillo, David de la Fuente & Raúl Pino

Authors
  1. Nicolás Álvarez-Gil
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rafael Rosillo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. David de la Fuente
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Raúl Pino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nicolás Álvarez-Gil.

Additional information

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

Álvarez-Gil, N., Rosillo, R., de la Fuente, D. et al. A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system. Cent Eur J Oper Res 29, 1353–1374 (2021). https://doi.org/10.1007/s10100-020-00701-w

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-020-00701-w

Keywords

Search

Navigation