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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
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)
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)
Baker, K.R.: Introduction to Sequencing and Scheduling. John Wiley & Sons, Hoboken (1974)
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)
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)
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)
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
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)
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)
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
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
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)
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)
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
Cheng, T., Kahlbacher, H.: Scheduling with delivery and earliness penalties. Asia-Pacific J. Oper. Res. 10(2), 145–152 (1993)
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)
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)
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)
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)
Garey, M.R., Johnson, D.S., Sethi, R.: The complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1(2), 117–129 (1976)
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
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
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)
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)
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)
Ochi, H., Driss, O.B.: Scheduling the distributed assembly flowshop problem to minimize the makespan. Procedia Comput. Sci. 164, 471–477 (2019)
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)
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
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
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
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
DOI: https://doi.org/10.1007/978-3-030-96299-9_48
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-96298-2
Online ISBN: 978-3-030-96299-9
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)