Skip to main content

Heterogeneous Distributed Flow Shop Scheduling and Reentrant Hybrid Flow Shop Scheduling in Seamless Steel Tube Manufacturing

  • Conference paper
  • First Online:
Bio-Inspired Computing: Theories and Applications (BIC-TA 2020)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1363))

Abstract

In the actual manufacturing process of seamless steel tubes, the scheduling of ordinary production workshops and cold drawing workshops is a problem with NP-hard characteristics. Aiming at ordinary production workshops and cold drawing workshops, distributed flow shop scheduling models and reentrant scheduling models are established. The two are heterogeneously distributed in space and have a sequential relationship in time. For the distributed flow shop scheduling, the fruit fly optimization method is used to solve the problem, and the NEH (Nawaz, Enscore,&Ham) heuristic is used to improve the quality of the initial solution in the initialization phase, and the load distribution in the factory is considered. Simulated annealing algorithm is used to optimize reentrant scheduling, which is of great significance to the actual production of seamless steel tubes.

Supported by the Beijing Municipal Natural Science Foundation under Grant L191011.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Meng, T., Pan, Q.-K., Wang, L.: A distributed permutation flow shop scheduling problem with the customer order constraint. Knowl.-Based Syst. 184, 104894 (2019)

    Article  Google Scholar 

  2. Fu, Y., Tian, G., Fathollahi-Fard, A.M., Ahmadi, A., Zhang, C.: Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint. J. Clean. Prod. 226, 515–525 (2019)

    Article  Google Scholar 

  3. Bargaoui, H., Driss, O.B., Ghédira, K.: A novel chemical reaction optimization for the distributed permutation flow shop scheduling problem with makespan criterion. Comput. Ind. Eng. 111, 239–250 (2017)

    Article  Google Scholar 

  4. Shao, Z., Pi, D., Shao, W.: Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flowshop in distributed environment. Expert Syst. Appl. 145, 113147 (2020)

    Article  Google Scholar 

  5. Zhang, G., Xing, K.: Differential evolution metaheuristics for distributed limited-buffer flow shop scheduling with makespan criterion[J]. Comput. Oper. Res. 108, 33–43 (2019)

    Article  MathSciNet  Google Scholar 

  6. Li, Y., Li, F., Pan, Q.-K., Gao, L., Tasgetiren, M.F.: An artificial bee colony algorithm for the distributed hybrid flow shop scheduling problem. Proc. Manuf. 39, 1158–1166 (2019)

    Google Scholar 

  7. Ying, K.-C., Lin, S.-W.: Minimizing makespan for the distributed hybrid flow shop scheduling problem with multiprocessor tasks. Expert Syst. Appl. 92, 132–141 (2018)

    Article  Google Scholar 

  8. Chen, J., Wang, L., Peng, Z.: A collaborative optimization algorithm for energy-efficient multi-objective distributed no-idle flow shop scheduling. Swarm Evol. Comput. 50, 100557 (2019)

    Article  Google Scholar 

  9. Zhang, G., Xing, K.: Memetic social spider optimization algorithm for scheduling two-stage assembly flow shop in a distributed environment. Comput. Ind. Eng. 125, 423–433 (2018)

    Article  Google Scholar 

  10. Lin, C.-C., Liu, W.-Y., Chen, Y.-H.: Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity. Comput. Ind. Eng. 139, 106154 (2020)

    Article  Google Scholar 

  11. Rifai, A.P., Nguyen, H.-T., Dawal, S.Z.M.: Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling. Appl. Soft Comput. 40, 42–57 (2016)

    Article  Google Scholar 

  12. Cho, H.-M., Bae, S.-J., Kim, J., Jeong, I.-J.: Bi-objective scheduling for reentrant hybrid flow shop using Pareto genetic algorithm. Comput. Ind. Eng. 61(3), 529–541 (2011)

    Article  Google Scholar 

  13. Pan, W.-T.: A new Fruit Fly Optimization Algorithm: taking the financial distress model as an example. Knowl.-Based Syst. 26, 69–74 (2012)

    Article  Google Scholar 

  14. Nawaz, M., Enscore, E.E., Ham, I.: A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. Omega 11(1), 91–95 (1983)

    Article  Google Scholar 

  15. Cai, J., Zhou, R., Lei, D.: Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks. Eng. Appl. Artif. Intell. 90, 103540 (2020)

    Article  Google Scholar 

  16. Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1993)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiuli Wu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, X., Xie, Z. (2021). Heterogeneous Distributed Flow Shop Scheduling and Reentrant Hybrid Flow Shop Scheduling in Seamless Steel Tube Manufacturing. In: Pan, L., Pang, S., Song, T., Gong, F. (eds) Bio-Inspired Computing: Theories and Applications. BIC-TA 2020. Communications in Computer and Information Science, vol 1363. Springer, Singapore. https://doi.org/10.1007/978-981-16-1354-8_8

Download citation

  • DOI: https://doi.org/10.1007/978-981-16-1354-8_8

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-16-1353-1

  • Online ISBN: 978-981-16-1354-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics