[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

A new approach for solving the flow‐shop scheduling problem using a parallel optimization algorithm

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

In any organization and business, efficient scheduling cause increased efficiency, reducing the time required to complete jobs and increasing an organization’s profitability in a competitive environment. Also, the flow-shop scheduling problem is a vital type of scheduling problem with many real-world applications. Flow-shop scheduling has numerous exciting applications in various manufacturing and industrial domains. During the past eras, the growing interests in the arrangement of flow shops with diverse objective functions (for example, minimizing the makespan and flow-time) were observed. The permutation flow-shop is formulated as mixed-integer programming, and it is an NP-Hard problem. Therefore, in this paper, a novel method is provided to decrease the makespan and completion time. Since parallel algorithms use some computing elements to accelerate the search and present a new exploration pattern that is frequently suitable to enhance the quality of the results, in this research, a parallel ant colony optimization algorithm is employed to solve the mentioned problem. The Matlab simulation setting in Net Beans IDE 8.0.2 and Java to simulate the introduced method is applied. According to the obtained results, the suggested procedure has more efficiency than the previous methods. The Matlab simulator outcomes have indicated that the average response time has been improved compared to the PSO-SA and HBC algorithms. Also, the makespan is improved in comparison to GA and MOACSA.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Abdel-Basset M, Manogaran G, El-Shahat D, Mirjalili S (2018) A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener Comput Syst 85:129–145

    Article  Google Scholar 

  • Akhshabi M, Haddadnia J, Akhshabi M (2012) Solving flow shop scheduling problem using a parallel genetic algorithm. Procedia Technol 1:351–355

    Article  Google Scholar 

  • Alekseeva E, Mezmaz M, Tuyttens D, Melab N (2017) Parallel multi-core hyper‐heuristic GRASP to solve permutation flow‐shop problem. Concurr Comput Pract Exp 29(9):e3835

    Article  Google Scholar 

  • Asghari S, Navimipour NJ (2019) Cloud service composition using an inverted ant colony optimisation algorithm. Int J Bio-Inspired Comput 13(4):257–268

    Article  Google Scholar 

  • Asghari S, Navimipour NJ (2019) Resource discovery in the peer to peer networks using an inverted ant colony optimization algorithm. Peer-to-Peer Netw Appl 12(1):129–142

    Article  Google Scholar 

  • Azad P, Navimipour NJ (2017) An energy-aware task scheduling in the cloud computing using a hybrid cultural and ant colony optimization algorithm. International Journal of Cloud Applications Computing (IJCAC) 7(4):20–40

    Article  Google Scholar 

  • Barbosa H (ed) (2013) Ant colony optimization: techniques and applications. https://doi.org/10.5772/3423

  • Basseur M, Seynhaeve F, Talbi E-g (2002) Design of multi-objective evolutionary algorithms: application to the flow-shop scheduling problem. In: Proceedings of the 2002 congress on evolutionary computation. CEC’02 (Cat. No. 02TH8600), IEEE

  • Bertel S, Billaut J-C (2004) A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recirculation. Eur J Oper Res 159(3):651–662

    Article  MathSciNet  Google Scholar 

  • Bullnheimer B, Kotsis G, Strauss C (1997) Parallelization strategies for the ant system. High performance algorithms and software in non linear optimization, applied optimization series, vol 24. Kluwer, Dordrecht

    MATH  Google Scholar 

  • Chang L, Liao C, Lin W, Chen L-L, Zheng X (2012) A hybrid method based on differential evolution and continuous ant colony optimization and its application on wideband antenna design. Prog Electromagn Res 122:105–118

    Article  Google Scholar 

  • Chang P-T, Lin K-P, Pai P-F, Zhong C-Z, Lin C-H, Hung L-T (2008) Ant colony optimization system for a multi-quantitative and qualitative objective job-shop parallel-machine-scheduling problem. Int J Prod Res 46(20):5719–5759

    Article  Google Scholar 

  • Chen J-S, Pan JC-H, Lin C-M (2008) A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Syst Appl 34(1):570–577

    Article  Google Scholar 

  • Chong CS, Low MYH, Sivakumar AI, Gay KL (2006) A bee colony optimization algorithm to job shop scheduling. In: Proceedings of the 2006 winter simulation conference. IEEE, pp 1954–1961

  • Delévacq A, Delisle P, Gravel M, Krajecki M (2013) Parallel ant colony optimization on graphics processing units. J Parallel Distrib Comput 73(1):52–61

    Article  Google Scholar 

  • Elmi A, Topaloglu S (2016) Multi-degree cyclic flow shop robotic cell scheduling problem: ant colony optimization. Comput Oper Res 73:67–83

    Article  MathSciNet  Google Scholar 

  • Engin O, Güçlü A (2018) A new hybrid ant colony optimization algorithm for solving the no-wait flow shop scheduling problems. Appl Soft Comput 72:166–176

    Article  Google Scholar 

  • Fan B, Yang W, Zhang Z (2019) Solving the two-stage hybrid flow shop scheduling problem based on mutant firefly algorithm. J Ambient Intell Humaniz Comput 10(3):979–990

    Article  Google Scholar 

  • Ferone D, Hatami S, González-Neira EM, Juan AA, Festa P (2020) A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem. Int Trans Oper Res 27(3):1368–1391

    Article  MathSciNet  Google Scholar 

  • Fink A, Voß S (2003) Solving the continuous flow-shop scheduling problem by metaheuristics. Eur J Oper Res 151(2):400–414

    Article  MathSciNet  Google Scholar 

  • Janiak A, Kozan E, Lichtenstein M, Oğuz C (2007) Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. Int J Prod Econ 105(2):407–424

    Article  Google Scholar 

  • Kai S, Genke Y (2006) An effective hybrid optimization algorithm for the flow shop scheduling problem. In: 2006 IEEE international conference on information acquisition, IEEE

  • Kaur G, Bala A (2019) An efficient resource prediction–based scheduling technique for scientific applications in cloud environment. Concurr Eng 27(2):112–125

    Article  Google Scholar 

  • Komaki G, Kayvanfar V (2015) Grey Wolf Optimizer algorithm for the two-stage assembly flow shop scheduling problem with release time. J Comput Sci 8:109–120

    Article  Google Scholar 

  • Kumar Samuel R, Venkumar P (2014) Performance evaluation of a hybridized simulated annealing algorithm for flow shop scheduling under a dynamic environment. Kybernetes 43(7):1024–1039

    Article  MathSciNet  Google Scholar 

  • Li J-q, Han Y-q (2020) “A hybrid multi-objective artificial bee colony algorithm for flexible task scheduling problems in cloud computing system.” Clust Comput 23(4):2483–2499

    Article  Google Scholar 

  • Li M, Lei D, Cai J (2019) Two-level imperialist competitive algorithm for energy-efficient hybrid flow shop scheduling problem with relative importance of objectives. Swarm Evol Comput 49:34–43

    Article  Google Scholar 

  • Liu S, Liu X, Pei J, Pardalos PM, Song Q (2020) Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm. Optim Methods Softw 35(1):116–141

    Article  MathSciNet  Google Scholar 

  • Mahdavi A, Shiri ME (2015) An augmented Lagrangian ant colony based method for constrained optimization. Comput Optim Appl 60(1):263–276

    Article  MathSciNet  Google Scholar 

  • Mircea A (2012) Main aspects concerning PCB manufacturing optimization. Circuit World 38(2):75–82

    Article  MathSciNet  Google Scholar 

  • Mu H, Jiang P, Leng J (2017) Costing-based coordination between mt-iPSS customer and providers for job shop production using game theory. Int J Prod Res 55(2):430–446

    Article  Google Scholar 

  • Navimipour NJ, Milani BA (2016) Replica selection in the cloud environments using an ant colony algorithm. In: 2016 third international conference on digital information processing, data mining, and communications W (DIPDMWC), IEEE

  • Pedemonte M, Nesmachnow S, Cancela H (2011) A survey on parallel ant colony optimization. Appl Soft Comput 11(8):5181–5197

    Article  Google Scholar 

  • Rabani M, Yazdanparast R (2019) Optimization of parallel machine scheduling problem with human resiliency engineering: a new hybrid meta-heuristics approach. J Ind Syst Eng 12(2):31–45

    Google Scholar 

  • Rajkumar R, Robert RJ (2019) A hybrid algorithm for multi-objective optimization of minimizing makespan and total flow time in permutation flow shop scheduling problems. Inf Technol Control 48(1):47–57

    Google Scholar 

  • Riahi V, Kazemi M (2018) A new hybrid ant colony algorithm for scheduling of no-wait flowshop. Oper Res Int J 18(1):55–74

    Article  Google Scholar 

  • Ruiz R, Stützle T (2007) A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur J Oper Res 177(3):2033–2049

    Article  Google Scholar 

  • Wu Y, Liu M, Wu C (2003) A genetic algorithm for solving flow shop scheduling problems with parallel machine and special procedure constraints. In: Proceedings of the 2003 international conference on machine learning and cybernetics (IEEE Cat. No. 03EX693), IEEE

  • Xu Z, Xu D, He J, Wang Q, Liu A, Xiao J (2018) Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint. Arab J Sci Eng 43(2):777–788

    Article  Google Scholar 

  • Yagmahan B, Yenisey MM (2010) A multi-objective ant colony system algorithm for flow shop scheduling problem. Expert Syst Appl 37(2):1361–1368

    Article  Google Scholar 

  • Zhang Y, Yu Y, Zhang S, Luo Y, Zhang L (2019) Ant colony optimization for Cuckoo Search algorithm for permutation flow shop scheduling problem. Syst Sci Control Eng 7(1):20–27

    Article  Google Scholar 

  • Zhao F, Xue F, Zhang Y, Ma W, Zhang C, Song H (2019) A discrete gravitational search algorithm for the blocking flow shop problem with total flow time minimization. Applied Intelligence 49(9):3362–3382

    Article  Google Scholar 

  • Zheng X, Zhou S, Chen H (2019) Ant colony optimisation algorithms for two-stage permutation flow shop with batch processing machines and nonidentical job sizes. Int J Prod Res 57(10):3060–3079

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Payame Noor University (PNU), P.O.Box 19395-4697, Tehran, Iran

    Habibeh Nazif

Authors
  1. Habibeh Nazif
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Habibeh Nazif.

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

Nazif, H. A new approach for solving the flow‐shop scheduling problem using a parallel optimization algorithm. J Ambient Intell Human Comput 12, 10723–10732 (2021). https://doi.org/10.1007/s12652-020-02881-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-020-02881-4

Keywords

Search

Navigation