Skip to main content

The Bi-level Assembly Flow-Shop Scheduling Problem with Batching and Delivery with Capacity Constraint

  • Conference paper
  • First Online:
Book cover Innovations in Bio-Inspired Computing and Applications (IBICA 2021)

Abstract

In most manufacturing and assembly systems, a number of operations are performed on each job. Most of these operations are performed in the same order on all tasks, ie the works flow in the same direction. In such an environment, known as flow shop, the machines are arranged in series. In this the bi-Level assembly flow-shop scheduling problem with Capacity Constrains batching and delivery system is presented. Here, m is a single machine that do different parts of the job, and in the second part, number of machines have the duty of assembly. In this paper, a mixed nonlinear integer math model is formulated. The objective of this model is include minimizing the cost of delays, delivery, and categorization. For solving the model in small dimensions, the Branch and Bound method are used in GAMS and finally numerical examples and Analysis are done.

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 189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 249.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. Lee, C.-Y., Cheng, T., Lin, B.M.T.: Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Manage. Sci. 39(5), 616–625 (1993)

    Article  Google Scholar 

  2. Goodarzian, F., Wamba, S.F., Mathiyazhagan, K., Taghipour, A.: A new bi-objective green medicine supply chain network design under fuzzy environment: hybrid metaheuristic algorithms. Comput. Indust. Eng. 160, 107535 (2021)

    Article  Google Scholar 

  3. Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, Hoboken (1974)

    Google Scholar 

  4. Rahman, H.F., Janardhanan, M.N., Chuen, L.P., Ponnambalam, S.G.: Flowshop scheduling with sequence dependent setup times and batch delivery in supply chain. Comput. Indust. Eng. 158, 107378 (2021)

    Article  Google Scholar 

  5. Jabbari, M., Tavana, M., Fattahi, P., Daneshamooz, F.: A parameter tuned hybrid algorithm for solving flow shop scheduling problems with parallel assembly stages. Sustain. Oper. Comput. 3, 22–32 (2021)

    Article  Google Scholar 

  6. Zhang, Z., Tang, Q.: Integrating flexible preventive maintenance activities into two-stage assembly flow shop scheduling with multiple assembly machines. Comput. Indust. Eng. 159, 107493 (2021)

    Article  Google Scholar 

  7. Goodarzian, F., Kumar, V., Abraham, A.: Hybrid meta-heuristic algorithms for a supply chain network considering different carbon emission regulations using big data characteristics. Soft. Comput. 25(11), 7527–7557 (2021). https://doi.org/10.1007/s00500-021-05711-7

    Article  Google Scholar 

  8. Goodarzian, F., Kumar, V., Ghasemi, P.: A set of efficient heuristics and meta-heuristics to solve a multi-objective pharmaceutical supply chain network. Comput. Indust. Eng. 158, 107389 (2021)

    Article  Google Scholar 

  9. Goodarzian, F., Taleizadeh, A.A., Ghasemi, P., Abraham, A.: An integrated sustainable medical supply chain network during COVID-19. Eng. Appl. Artif. Intell. 100, 104188 (2021)

    Article  Google Scholar 

  10. Ghasemi, P., Goodarzian, F., Gunasekaran, A., Abraham, A.: A bi-level mathematical model for logistic management considering the evolutionary game with environmental feedbacks. Int. J. Logist. Manage. (2021). (ahead-of-print). https://doi.org/10.1108/IJLM-04-2021-0199

  11. Goodarzian, F., Bahrami, F., Shishebori, D.: A new location-allocation-problem for mobile telecommunication rigs model under crises and natural disasters: a real case study. J. Ambient. Intell. Humaniz. Comput. 1−19 (2021). https://doi.org/10.1007/s12652-021-03461-w

  12. Yang, S., Xu, Z.: The distributed assembly permutation flowshop scheduling problem with flexible assembly and batch delivery. Int. J. Prod. Res. 59(13), 4053–4071 (2021)

    Article  Google Scholar 

  13. Basir, S.A., Mazdeh, M.M., Namakshenas, M.: Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling problem with batch delivery system. Comput. Ind. Eng. 126, 217–231 (2018)

    Article  Google Scholar 

  14. Ceylan, Z., Tozan, H., Bulkan, S.: A coordinated scheduling problem for the supply chain in a flexible job shop machine environment. Oper. Res. Int. Journal 21(2), 875–900 (2021). https://doi.org/10.1007/s12351-020-00615-0

    Article  Google Scholar 

  15. Cheng, T., Kahlbacher, H.: Scheduling with delivery and earliness penalties. Asia-Pacific J. Oper. Res. 10(2), 145–152 (1993)

    MATH  Google Scholar 

  16. Goodarzian, F., Abraham, A., Fathollahi-Fard, A.M.: A biobjective home health care logistics considering the working time and route balancing: a self-adaptive social engineering optimizer. J. Comput. Des. Eng. 8(1), 452–474 (2021)

    Google Scholar 

  17. Kazemi, H., Mazdeh, M.M., Rostami, M.: The two stage assembly flow-shop scheduling problem with batching and delivery. Eng. Appl. Artif. Intell. 63, 98–107 (2017)

    Article  Google Scholar 

  18. Potts, C.N., Sevast’Janov, S.V., Strusevich, V.A., Van Wassenhove, L.N., Zwaneveld, C.M.: The two-stage assembly scheduling problem: complexity and approximation. Oper. Res. 43(2), 346–355 (1995)

    Article  MathSciNet  Google Scholar 

  19. Mazdeh, M.M., Rostami, M.: A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs. Int. J. Syst. Sci. Oper. Logist. 1(2), 94–104 (2014)

    Google Scholar 

  20. Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)

    Article  MathSciNet  Google Scholar 

  21. Belabid, J., Aqil, S., Allali, K.: Solving permutation flow shop scheduling problem with sequence-independent setup time. J. Appl. Math. 2020, 1–11 (2020). https://doi.org/10.1155/2020/7132469

    Article  MathSciNet  MATH  Google Scholar 

  22. Taxidou, A., Karafyllidis, I., Marinaki, M., Marinakis, Y., Migdalas, A.: A hybrid firefly - VNS algorithm for the permutation flowshop scheduling problem. In: Sifaleras, A., Salhi, S., Brimberg, J. (eds.) Variable Neighborhood Search: 6th International Conference, ICVNS 2018, Sithonia, Greece, October 4–7, 2018, Revised Selected Papers, pp. 274–286. Springer International Publishing, Cham (2019). https://doi.org/10.1007/978-3-030-15843-9_21

    Chapter  Google Scholar 

  23. Wang, K., Luo, H., Liu, F., Yue, X.: Permutation flow shop scheduling with batch delivery to multiple customers in supply chains. IEEE Trans. Syst. Man Cybern. Syst. 48(10), 1826–1837 (2017)

    Article  Google Scholar 

  24. Al-Behadili, M., Ouelhadj, D., Jones, D.: Multi-objective biased randomised iterated greedy for robust permutation flow shop scheduling problem under disturbances. J. Oper. Res. Soc. 71(11), 1847–1859 (2020)

    Article  Google Scholar 

  25. Goodarzian, F., Hosseini-Nasab, H., Muñuzuri, J., Fakhrzad, M.B.: A multi-objective pharmaceutical supply chain network based on a robust fuzzy model: a comparison of meta-heuristics. Appl. Soft Comput. 92, 106331 (2020)

    Article  Google Scholar 

  26. Ochi, H., Driss, O.B.: Scheduling the distributed assembly flowshop problem to minimize the makespan. Procedia Comput. Sci. 164, 471–477 (2019)

    Article  Google Scholar 

  27. Pessoa, L.S., Andrade, C.E.: Heuristics for a flowshop scheduling problem with stepwise job objective function. Eur. J. Oper. Res. 266(3), 950–962 (2018)

    Article  MathSciNet  Google Scholar 

  28. Goodarzian, F., Ghasemi, P., Gunasekaren, A., Taleizadeh, A.A., Abraham, A.: A sustainable-resilience healthcare network for handling COVID-19 pandemic Ann. Oper. Res. 1−65 (2021). https://doi.org/10.1007/s10479-021-04238-2

Download references

Acknowledgement

This research has been financially supported by The Analytical Center for the Government of the Russian Federation (Agreement No. 70-2021-00143 dd. 01.11.2021, IGK 000000D730321P5Q0002).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ajith Abraham .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Garjan, H.S., Molaei, A.A., Fozooni, N., Abraham, A. (2022). The Bi-level Assembly Flow-Shop Scheduling Problem with Batching and Delivery with Capacity Constraint. In: Abraham, A., et al. Innovations in Bio-Inspired Computing and Applications. IBICA 2021. Lecture Notes in Networks and Systems, vol 419. Springer, Cham. https://doi.org/10.1007/978-3-030-96299-9_48

Download citation

Publish with us

Policies and ethics