In this paper, a new model of capacitated lot sizing and scheduling in a permutation flow shop is developed. In this model demand can be totally backlogged. Setups can be carryover and are sequence-dependent. It is well-known from literatures that capacitated lot sizing problem in permutation flow shop systems are NP-hard. This means the model is solved in polynomial time and metaheuristics algorithms are capable of solving these problems within reasonable computing load. Metaheuristic algorithms find more applications in recent researches. On this concern this paper proposes two evolutionary algorithms, one of the most popular namely, Genetic Algorithm (GA) and one of the most powerful population base algorithms namely, Imperialist Competitive Algorithm (ICA). The proposed algorithms are calibrate by Taguchi method and be compared against a presented lower bound. Some numerical examples are solved by both the algorithms and the lower bound. The quality of solution obtained by the proposed algorithm showed superiority of ICA to GA.

[1] Johnson SM. Optimal two- and three-stage production schedules with setup times included. 1954;1(61-68).
[2] Quadt D, Kuhn H. Capacitated lot-sizing with extensions: a review. 2008;6(61–83).
[3] Quadt D, Kuhn H. Capacitated Lot-Sizing and Scheduling with Parallel Machines, Back-Orders, and Setup Carry-Over. 2009;56.
[4] Song Y, Chan GH. Single item lot-sizing problems with backlogging on a single machine at a finite production rate. 2005;161 (191–202).
[5] Wolsey Y, Pochet L. Lot size models with back-logging: Strong reformulations and cutting planes. 1988;40(317–335).
[6] Cheng H, Madan MS, Gupta Y, So S. Solving the capacitated lot- sizing problem with backorder consideration. 2001;52(952–959).
[7] Karimi B, Fathemi Ghomi SMT, Wilson JM. A tabu search heuristic for solving the CLSP with backlogging and set-up carry-over. 2006;57(140–147).
[8] Graham RL, Lawler E L, Lenstra J K, Kan AHGR. Optimisation and approximation in deterministic sequencing and scheduling: a survey. A. 1979;5 (287-326).
[9] Mohammadi M, Fatemi Ghomi SMT, Jafar N. A genetic algorithm for simultaneous lotsizing and sequencing of the permutation flow shops with sequence-dependent setups. 2011;24(87-93).
[10] Ruiz R, Maroto C, Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. 2006;34(461-476).
[11] Allada E, Ruiz R. Genetic algorithms with path relinking for the minimum tardi-ness permutation flow shop problem. 2010;38(57 - 67).
[12] Tseng LY, Lin YT. A hybrid genetic local search algorithm for the permutation flowshop scheduling problem. 2009;198(84 – 92).
[13] Tavakkoli-Moghaddam R, Gholipour-Kanani Y, Cheraghalizadeh R. A genetic algorithm and memetic algorithm to sequencing and scheduling of cellular manufacturing systems. 2008;3(2).
[14] Goren HG, Tunali S, Jans R. A review of applications of genetic algorithms in lot sizing. 2010;21(575–590).
[15] Atashpaz-Gargari E, Lucas C. Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. 2007(4661– 4667).
[16] Gao KL, Chaoyong Z, Xinyu S, Liang. Optimization of process planning with various flexibilities using an imperialist competitive algorithm. 2012; 59 (5-8)(815-828).
[17] Attar SF, Mohammadi M, Tavakkoli-Moghaddam R. A Novel Imperialist Competitive Algorithm to Solve Flexible Flow Shop Scheduling Problem in Order to Minimize Maximum Completion Time. 2011;28.
[18] Shokrollahpour E, Zandieh M, Dorri B. A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem. 2010;49(11).
[19] Rajabioun R, Atashpaz-Gargari E, Lucas C. Colonial competitive algorithm as a tool for Nash equilibrium point achievement. 2008;49 (11)(680– 695).
[20] Khabbazi A, Gargari E, Lucas C. Imperialist competitive algorithm for minimum bit error rate beamforming. 2009;1(125–133).
[21] Kaveh A, Talatahari S. Optimum design of skeletal structures using imperialist competitive algorithm. 2010;88(21–22).
[22] Lucas C, Nasiri-Gheidari Z, Tootoonchian F. Application of an imperialist competitive algorithm to the design of a linear induction motor. 2010;51(7)(1407–1411).
[23] Nazari-Shirkouhi S, H E, Ghodsi R, Rezaie K, Atashpaz- Gargari E. Solving the integrated product mix-outsourcing problem using the imperialist competitive algorithm. 2010;37(12).
[24] Sarayloo F, Tavakkoli-Moghaddam R. Imperialistic competitive algorithm for solving a dynamic cell formation problem with production planning. 2010(266–276).
[25] Quan-Ke P, Tasgetiren MF, Yun-Chia L. A Discrete Particle Swarm Optimization Algorithm for the Permutation Flowshop Sequencing Problem with Makespan Criterion. 2006.
[26] Udomsakdigool A, Khachitvichyanukul V. Ant colony algorithm for multi-criteria job shop scheduling to minimize makespan, mean flow time and mean tardiness. International Journal of Management Science and Engineering Management. 2011; 6(2)(117-123):6(2): 117-123.
[27] Mohammadi M, Fatemi Ghomi SMT. Genetic algorithm-based heuristic for capacitated lotsizing problem in flow shops with sequence-dependent setups. 2011;38(7201–7207).
[28] Holland JH. Adaptation in natural and artificial systems. 1975.
[29] Nagano MS, Ruiz, R, Lorena LAN. A constructive genetic algorithm for permutation flowshop scheduling. 2008;55(195–207).
[30] Kayvanfar V, Zandieh M. The economic lot scheduling problem with deteriorating items and shortage: an imperialist competitive algorithm.
[31] Abdi B, Mozafari H, Ayob A, Kohandel R. Imperialist Competitive Algorithm and its Application in Optimization of Laminated Composite Structures. 2011;55(2).
[32] Kayvanfar V, Zandieh M. The economic lot scheduling problem with deteriorating items and shortage: an imperialist competitive algorithm. 2012.
[33] Pasandideh SHR, Niaki STA, Yeganeh JA. A parameter-tuned genetic algorithm for multi-product economic production quantity model with space constraint, discrete delivery orders and shortages. 2010;41(306–314).
[34] Taguchi G. Introduction to quality engineering. 1986.
[35] Taguchi G. Introduction to quality engineering. White Plains: Asian Productivit; 1986.
[36] Grabowski J, Wodecki M. A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion. 2004;31(11).
[37] Onwubolu GC, Davendra D. Scheduling flow shops using differential evolution algorithm. 2006;171(2).

@article{babaei02061004,
title = "Development of Automated Glass Frosting Machine ",
journal = "International Journal of Science and Engineering Applications (IJSEA)",
volume = "2",
number = "6",
pages = "130 - 140",
year = "2013",
author = "M.Babaei, M.Mohammadi, S. M. T Fatemi, M. A Sobhanallahi ",
}