Economic Lot Sizing and Scheduling in Distributed Permutation Flow Shops

Document Type: Original Manuscript

Authors

1 Department of Industrial Engineering, Faculty of Engineering, Kharazmi University,Tehran, Iran

2 Department of Industrial Engineering, Faculty of Engineering, Kharazmi University, Tehran, Iran

10.22094/joie.2018.542997.1510

Abstract

This paper addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem with number of identical factories and machines. Different products must be distributed between the factories and then assignment of products to factories and sequencing of the products assigned to each factory has to be derived. The objective is to minimize the sum of setup costs, work-in-process inventory costs and finished products inventory costs per unit of time. Since the proposed model is NP-hard, an efficient Water Cycle Algorithm is proposed to solve the model. To justify proposed WCA, Monarch Butterfly Optimization (MBO), Genetic Algorithm (GA) and combination of GA and simplex are utilized. In order to determine the best value of algorithms parameters that result in a better solution, a fine-tuning procedure according to Response Surface Methodology is executed.

Graphical Abstract

Economic Lot Sizing and Scheduling in Distributed Permutation Flow Shops

Highlights

  • This paper generalizes the single factory lot sizing and scheduling problems for the case multi factory.
  • It addresses a new mixed integer nonlinear and linear mathematical programming economic lot sizing and scheduling problem in distributed permutation flow shop problem.
  • An efficient Water Cycle Algorithm is proposed to solve the model. To justify proposed WCA, Monarch Butterfly Optimization (MBO), Genetic Algorithm (GA) and combination of GA and simplex are utilized.

Keywords

Main Subjects


Akrami, B., Karimi, B., Moattar Hosseini, S.M. (2006). Two metaheuristic methods for the common cycle economiclot sizing and scheduling in flexible flow shops with limitedintermediate buffers: The finite horizon case. Applied Mathematics and Computation, 183, 634–645

Bargaoui, H., Driss, O.B., Ghedira, K. (2017). A Novel Chemical Reaction Optimization for theDistributed  Permutation  Flowshop  Scheduling  Problem  with Makespan  Criterion,  Computers  &  Industrial Engineering, doi: http://dx.doi.org/10.1016/j.cie.2017.07.020.

Brown, C., Liebovitch, L.S.,& Glendon, R. (2007). Lévy flights in Dobe Ju/’hoansi foraging patterns.Human Ecol, 35: 129-138.

Chan F.T.S., Chung S.H.,& Chan P.L.Y. (2005). An adaptive genetic algorithm with dominated genes for distributed scheduling problems.Expert System with Applications, Vol. 29: 364-371.

David S. (1993). The water cycle, illustrations by John Yates, Thomson Learning,New York.

Dobson, G.,& Yano, C.A. (1994). Cyclic scheduling to minimize inventory in a batch flow line.European Journal of Operational Research, 75: 441–461.

Eilon, S. (1959). Economic batch-size determination for multi-product scheduling.Operations Research, 10(4): 217–227.

Elhameed, A.,& El-Fergany, A.A. (2017). Water Cycle Algorithm-based Economic Dispatcher for Sequential and Simultaneous Objectives Including Practical Constraints.Applied Soft Computing. DOI.org/10.1016/j.asoc.2017.04.046.

El-Najdawi, M. (1989). Common cycle approach to lot-size scheduling for multistage, multiproduct production processes.Unpublished PhD. Dissertation, Wharton School, University of Pennsylvania, Philadelphia, PA.

El-Najdawi, M. (1992). A compact heuristic for common cycle lot-size scheduling in multi-stage, multi-product production processes.International Journal of Production Economics, 27(1): 29–41.

El-Najdawi, M.,& Kleindorfer, P.R. (1993). Common cycle lot-size scheduling for multi-product, multi-stage production.Management Science, 39:872–885.

El-Najdawi, M. (1994). A job-splitting heuristic for lot-size scheduling in multi-stage, multi-product production processes.European Journal of Operational Research, 75: 365–377.

Eskandar, H., Sadollah, A., Bahreininejad, A.,& Hamdi, M. (2012). Water cycle algorithm: A novel metaheuristic optimization method for solving constrained engineering optimization problems.Computers and Structures, 151-166

Hsu, J.I.S.,& El-Najdawi, M. (1990). Common cycle scheduling in a multistage production process.Engineering Costs and Production Economics, 20: 73–80.

Karimi, B., Fatemi Ghomi, S.M.T.,& Wilson, JM. (2003). The capacitated lot sizing problem: a review of models and algorithms.Omega, 31 (5): 365-378.

Khodabakhshian, A., Esmaili, M-R.,& Bornapour, M. (2016). Optimal coordinated design of UPFC and PSS for improving power system performance by using multi-objective water cycle algorithm.Electrical Power and Energy Systems, 83: 124-133.

Li, X., Yin, M. (2013). An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure. Advances in Engineering Software, 55, 10–31

Maxwell, W.L. (1964). The scheduling of economic lot sizes.Naval Research Logistics Quarterly, 11: 89–124.

Naderi, B., Ruiz, R. (2009).The distributedpermutation flowshop problem. Computers and Operations Research, doi.10.1016/j.cor.2009.06. 019

Ouenniche, J., Boctor, F.F.,& Martel, A. (1999). The impact of sequencing decisions on multi-item lot sizing and scheduling in flow shops.International Journal of Production Research, 37(10): 2253–2270.

Pakzad-Moghaddam, S.H., Tavakkoli-Moghaddam, R.,& Mina, H. (2014). An approach for modeling a new single machine scheduling problem with deteriorating and learning effects.Computers &

       Industrial Engineering.DOI.org/10.1016/j.cie.2014.09.021.

Rahman, H.F., Sarker, R., Essam, D. (2015). A Genetic Algorithm for Permutation Flow ShopScheduling under Make to Stock Production system. Computers & Industrial Engineering, doi: http://dx.doi.org/10.1016/j.cie.2015.08.006

Rifai, A. P., Nguyen, H.T., &Dawal, S.Z. (2016). Multi-objective adaptive large Neighborhood search for distributed reentrant permutation flow shop scheduling.Applied Soft Computing, 40: 42–57.

Rodriguez, M.A., Vecchietti, A.R., Harjunkoski, I., &Grossmann, I.E. (2014). Optimal supply chain design and management over a multi-period horizon under demand uncertainty. Part I: MINLP and MILP models.Computers and Chemical Engineering, 62: 194–210.

Rogers, J. (1958). A computational approach to the economic lot scheduling problem.Management Science, 4(3): 264–291.

Sadollah, A., Eskandar, H., Bahreininejad, A., &Kim, J-H. (2015). Water cycle algorithm with evaporation rate for solving constrained and unconstrained optimization problems.Applied Soft Computing, 30: 48-51.

Sadollah, A., Eskandar, H., Yoo, D-G., &Kim, J-H. (2015). Approximate solving of nonlinear ordinary differential equations using least square weight function and metaheuristic algorithms., Engineering Applications of Artificial Intelligence, 40: 117-132.

Torabi, S.A., Karimi, B., &Fatemi Ghomi, S.M.T.  (2005). The common cycle economic lot scheduling in flexible job shops: The finite horizon case.International Journal of Production Economics, 97: 52–65.

You, F., &Grossmann, I.E. (2008). Integrated Multi-Echelon Supply Chain Design with Inventories under Uncertainty: MINLP Models.Computational Strategies, Carnegie Mellon University, USA.

Viagas, V.F., Gonzalez, P.P., Framinan, J. M. (2018). The distributed permutation flow shop to minimise the total flow time. Computers & Industrial Engineering, 118, 464–477.

Wang, B. (1997). Integrated product, process and enterprise design.Chapman and Hall, 1stEdition,

Wang, G-G., Deb, S., Zhao, X., &Cui, Z. (2016). A new monarch butterfly optimization with an improved crossover operator.Oper Res Int J. DOI 10.1007/s12351-016-0251-z

Wang, G-G., Deb, S., &Cui, Z. (2015). Monarch butterfly optimization.Neural Comput & Applic. DOI:10.1007/ s00521-015-1923-y.

Wang, G-G., Zhao, X., &Deb, S. (2015). A Novel Monarch Butterfly Optimization with Greedy Strategy and Self-adaptive Crossover Operator, 2nd international conference on soft computing & machine intelligence, Hong Kong, (ISCMI 2015),Nov 23–24. DOI 10.1109/ISCMI.2015.19