Skip to main content
Log in

Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

This paper deals with simultaneous scheduling of machines, automated guided vehicles (AGVs) and tools in a multi-machine flexible manufacturing system (FMS) considering the transfer times of jobs to minimize makespan (MSN). Only one copy of each type of tools is made available due to economic restrictions, and the tools are stored in a central tool magazine (CTM) that shares with and serves for several machines. Jobs and tools among machines are carried by AGVs and tool transporter (TT). This simultaneous scheduling problem is highly complex in nature as it involves job operations sequencing on machines, allocation of tools and AGVs to job operations and associated trip operations including the times of dead heading trip and loaded trip of AGVs. This paper presents a nonlinear mixed integer programming (MIP) formulation to model the combined scheduling of machines, AGVs and tools and a flower pollination algorithm (FPA) built on the flowers’ pollination process for solving this simultaneous scheduling problem. The results indicate the proposed FPA is superior in terms of final solution quality, efficiency, convergence rate and robustness.

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

Access this article

Subscribe and save

Springer+ Basic
$34.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 excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Explore related subjects

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

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to N. Sivarami Reddy.

Ethics declarations

Conflict of interest

Authors declare that they have no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by any of the authors.

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

Reddy, N.S., Ramamurthy, D.V., Lalitha, M.P. et al. Minimizing the total completion time on a multi-machine FMS using flower pollination algorithm. Soft Comput 26, 1437–1458 (2022). https://doi.org/10.1007/s00500-021-06411-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-021-06411-y

Keywords

Navigation