To minimize the total cost of the allocation of delivery, costs related to post, resource allocation and the maximum delay in the supply chain flow shop scheduling problem

Authors
Nahid Jabarzare
Morteza Rasti-Barzoki
Hossein Khosroshahi
Isfahan University of Technology
10.52547/jde.2.6.7
Abstract
In this study an integrated production/distribution problem in flow shop scheduling with tardiness costs، inventory costs and distribution and resource allocation costs is modeled. Imagine a supply chain in which several jobs are to be processed on several machines. Each job has a contracted due date. This paper aims at proposing an efficient model for minimizing total production and distribution costs which include tardiness costs، inventory costs and distribution and resource allocation costs. The mixed integer non-linear programming of the problem is then presented. Considering that these problems fall into the group of NP-hard we utilize a NSGAII algorithm to solve the proposed problem. This problem has been solved with small dimensions and restrictions on the Pareto frontier obtained Epsilon limitation and large-scale NSGAII meta-heuristic algorithm as well as small-scale solved the problem solving methods (Epsilon restrictions and NSGAII) are compared with each other.
Keywords
Supply chain scheduling
Multi-objective decision making
Flow shop scheduling
Epsilon limitation
NSGAII
Amin-Tahmasbi, H., & Tavakkoli-Moghaddam, R. (2011). Solving a bi-objective flowshop scheduling problem by a Multi-objective Immune System and comparing with SPEA2+ and SPGA. Adv. Eng. Softw., 42(10), 772-779. doi:10.1016/j.advengsoft.2011.05.015
Assarzadegan, P., & Rasti-Barzoki, M. (2016). Minimizing sum of the due date assignment costs, maximum tardiness and distribution costs in a supply chain scheduling problem. Applied Soft Computing, 47, 343-356.
Attar, S., Mohammadi, M., Tavakkoli-Moghaddam, R., & Yaghoubi, S. (2014). Solving a new multi-objective hybrid flexible flowshop problem with limited waiting times and machine-sequence-dependent set-up time constraints. International Journal of Computer Integrated Manufacturing, 27(5), 450-469.
Azadeh, A., Maleki Shoja, B., Ghanei, S., & Sheikhalishahi, M. (2015). A multi-objective optimization problem for multi-state series-parallel systems: A two-stage flow-shop manufacturing system. Reliability Engineering & System Safety, 136, 62-74. doi:http://dx.doi.org/10.1016/j.ress.2014.11.009
Caramia, M., & Dell´ Olmo, P. (2008). Multi-objective optimization. Multi-objective Management in Freight Logistics: Increasing Capacity, Service Level and Safety with Optimization Algorithms, 11-36.
Chankong, V., & Haimes, Y. (1983). Optimization-based methods for multiobjective decision-making-an overview. Large Scale Systems In Information And Decision Technologies, 5(1), 1-33.
Chen, C.-L., Vempati, V. S., & Aljaber, N. (1995). An application of genetic algorithms for flow shop problems. European Journal of Operational Research, 80(2), 389-396.
Davis, L. (1991). Handbook of genetic algorithms.
Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation, 6(2), 182-197.
Giannopoulos, N., Moulianitis, V. C., & Nearchou, A. C. (2012). Multi-objective optimization with fuzzy measures and its application to flow-shop scheduling. Eng. Appl. Artif. Intell., 25(7), 1381-1394. doi:10.1016/j.engappai.2012.06.011
Goldberg, D. E., & Holland, J. H. (1988). Genetic algorithms and machine learning. Machine learning, 3(2), 95-99.
Hassanzadeh, A., Rasti-Barzoki, M., & Khosroshahi, H. (2016). Two new meta-heuristics for a bi-objective supply chain scheduling problem in flow-shop environment. Applied Soft Computing, 49, 335-351.
Holland, J. H. (1992). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence: MIT press.
Rasti-Barzoki, M., & Hejazi, S. R. (2013). Minimizing the weighted number of tardy jobs with group due date assignment and capacity-constrained deliveries. International Journal of Industrial Engineering, 24(2), 203-214.
Sadfi, C., Penz, B., Rapine, C., Błażewicz, J., & Formanowicz, P. (2005). An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints. European Journal of Operational Research, 161(1), 3-10.
Zandieh, M., Ghomi, S. F., & Husseini, S. M. (2006). An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times. Applied Mathematics and Computation, 180(1), 111-127.