2015 2 3 3 127
1 - A Mixed Integer Linear Programming Model for the Design of Remanufacturing Closed–loop Supply Chain Network http://www.ijsom.com/article_2541.html 10.22034/2015.3.01 1 Closed-loop supply chain network design is a critical issue due to its impact on both economic and environmental performances of the supply chain. In this paper, we address the problem of designing a multi-echelon, multi-product and capacitated closed-loop supply chain network. First, a mixed-integer linear programming formulation is developed to maximize the total profit. The main contribution of the proposed model is addressing two economic viability issues of closed-loop supply chain. The first issue is the collection of sufficient quantity of end-of-life products are assured by retailers against an acquisition price. The second issue is exploiting the benefits of colocation of forward facilities and reverse facilities. The presented model is solved by LINGO for some test problems. Computational results and sensitivity analysis are conducted to show the performance of the proposed model. 0 - 820 832 - - Mbarek Elbounjimi Department of Industrial Engineering, University of Quebec, Trois Rivires, Canada Canada mbarek.elbounjimi@uqtr.ca - - Georges Abdulnour Department of Industrial Engineering, University of Quebec, Trois Rivires, Canada Canada georges.abdulnour@uqtr.ca - - Daoud Ait kadi Laval University, Québec, Canada Canada daoud.aitkadii@gmc.ulaval.ca Closed-loop supply chain Colocation decision Network design Remanufacturing Amin, S. H., & Zhang, G. (2012). An integrated model for closed-loop supply chain configuration and supplier selection: Multi-objective approach. Expert Systems with Applications, Vol. 39(8), pp. 6782-6791.##Beamon, B. M., & Fernandes, C., (2004). Supply-chain network configuration for product recovery. Production Planning & Control, Vol. 15(3), pp. 270-281.##Demirel, N.Ö., Gökçen, H., (2008). A mixed integer programming model for remanufacturing in reverse logistics environment. International Journal of Advanced Manufacturing Technology, Vol. 39(11-12), pp. 1197-1206.##Elbounjimi, M., Abdulnour, G., Ait-Kadi, D. (2014).Green Closed-loop Supply Chain Network Design: A Literature Review. International Journal of Operations and Logistics Management, Vol. 3(4), pp. 275-286.##Fleischmann, M, Beullens, P. Bloemhof-Ruwaard, J. M, Van Wassenhove, L. N (2001). The impact of product recovery on logistics network design, Production and Operations Management, Vol. 10 (2), pp. 156.##Guide Jr, V. D. R., Teunter, R. H., Van Wassenhove, L. N (2003). Matching demand and supply to maximize profits from remanufacturing". Manufacturing &Service Operations Management, Vol. 5(4), pp. 303-316.##Keyvanshokooh, E., Fattahi, M., Seyed-Hosseini, S. M., Tavakkoli Moghaddam, R. A (2013) dynamic pricing approach for returned products in integrated forward/reverse logistics network design. Applied Mathematical Modelling, Vol. 37(24), pp. 10182-10202. ##Ko, H. J. and Evans, G. W. (2007), “A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs. Computers & Operations Research. Vol. 34(2), pp. 346-366.##Lee, D.H, Dong, M. (2009). Dynamic network design for reverse logistics operations under uncertainty, Transp. Res. Part E, Vol. 45, pp. 61–71.##Pishvaee, M. S., Farahani, R. Z., & Dullaert, W.,(2010). A memetic algorithm for bi-objective integrated forward/reverse logistics network design. Computers and Operations. Research, Vol. 37(6), pp. 1100-1112.##Savaskan, R. C., Bhattacharya, S., Van Wassenhove, L. N., (2004). Closed-loop supply chain models with product remanufacturing, Management science, Vol. 50(2), pp. 239-252.##Salema, M. I. G., Barbosa-Povoa, A. P., & Novais, A. Q (2007). An optimization model for the design of a capacitated multi-product reverse logistics network with uncertainty. European Journal of Operational Research, Vol. 179(3), pp. 1063-1077.##Wang, H. F., & Hsu, H. W. (2010). A closed-loop logistic model with a spanning- tree based genetic algorithm. Computers & operations research, Vol. 37(2), pp. 376-389.##
1 - A Memetic Algorithm for the Vehicle Routing Problem with Cross Docking http://www.ijsom.com/article_2453.html 10.22034/2015.3.02 1 In this paper we address the VRPCD, in which a set of homogeneous vehicles are used to transport products from the suppliers to customers via a cross-dock. The products can be consolidated at the cross-dock but cannot be stored for very long as the cross-dock does not have long-term inventory-holding capabilities. The objective of the VRPCD is to minimize the total traveled distance while respecting time window constraints of suppliers and customers and a time horizon for the whole transportation operation. Rummaging through all the work of literature on vehicle routing problems with cross-docking, there is no work that considers that customer will receive its requests from several suppliers; this will be the point of innovation of this work. A heuristic and a memetic algorithm are used to solve the problem. The proposed algorithms are implemented and tested on data sets involving up to 200 nodes (customers and suppliers). The first results show that the memetic algorithm can produce high quality solutions. 0 - 833 855 - - Sanae Larioui University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Morocco sanae.larioui@gmail.com - - Mohamed Reghioui University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Morocco m.reghioui@gmail.com - - Abdellah El Fallahi University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Morocco aelfallahi@gmail.com - - Kamal El Kadiri University of abdelmalek Essaadi, Mhannech II, Tetouan, Morocco Morocco elkadiri@uae.ma Cross-docking Vehicle routing problem Pickup and Delivery Memetic algorithm Yang H.L., Sarker B. and Chang C.T. (2013). A two-warehouse partial backlogging inventory model for deteriorating items with permissible delay in payment under inflation. Applied Mathematical Modelling, Vol. 37, pp. 2717–2726.##M.Wen, J.Larsen, J.Clausen, J.F Cordeau, and G Laporte(2008), Vehicle routing with CrossDocking, Journal of Operational Research Society ,vol.60, pp 1708–1718.##Y. H Lee, W. J Jung, and K.M Lee (2006), Vehicle routing scheduling for cross docking in the supply chain.Computer and Industrial Engineering, vol.51, pp.247–256.##F.A Santos,G.R Mateus, and A.S Da Cunha (2011).A novel column generation algorithm for the vehicle routing problem with cross-docking. International conference on Network optimization,5th. pp 412-425.##Solomon. M (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, vol.35, pp.254–265.##J.H. Holland (1975). Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, MI, USA.##D.E. Goldberg(1989). Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, Reading, MA, USA.##P. Moscato(1999). Memetic algorithms: a short introduction. In D. Corne, M. Dorigo, and F. Glover, editors, New ideas in optimization, pp 219–234: McGraw-Hill.##C. Prins(2004), A simple and effective evolutionary algorithm for the vehicle routing problem, Computer Operations Research, vol.31, pp.1985–2002.##Sung, C.S., Song, S.H., 2003. Integrated service network design for a cross-docking supply chain network, Journal of the Operational Research Society, vol.54, pp.1283-1295.##Lee, Y.H., Jung, J.W., Lee, K.M.(2006). Vehicle routing scheduling for cross-docking in the supply chain, Computers & Industrial Engineering,vol.51, pp.247-256.##Apte,M.U., Viswanathan,S(2000).Effective cross docking for improving distribution efficiencies.International Journal of Logistics: Research and Applications,vol.3, pp.291–302,##N.Labadi ,C.Prins,M.Reghioui(2008). A memetic algorithm for the vehicle routing problem with Time windows , RAIRO Operations Research, vol.42(3), pp.415-431.##Musa R, Arnaout J P, Jung H (2010). Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Computers &Industrial Engineering, vol.59 (1), pp.85–92.##M.Reghioui(2008). Problèmes de tournées de véhicules avec fenêtres horaires ou préemption des taches. Thèse de doctorat de l’Université de Technologie de Troyes.185 p.##
1 - Strategic Alliance Decision-Making for the Auto Industry Base on an Integrate DEA and GM(1,1) Approach http://www.ijsom.com/article_2542.html 10.22034/2015.3.03 1 Strategic alliance promotes enterprise resources sharing and enhances the competitiveness of the marketplace. Therefore, finding a mutually beneficial partner to make a strategic alliance is an important issue for various industries. The aim of this paper is to propose a suitable method based on Grey theory and Data Envelopment Analysis (DEA). A method predicts future business and measure operation efficiency, by the use of critical input and output variables. From this, firms can find out their appropriate candidates. This research was implemented with realistic public data from four consecutive financial years (2009-2012) of twenty Auto Manufactures. The study tries to help target firm find the right alliance partners. The results show the most priori candidates in recent years. The study will be of interest for managers of Auto Manufacture in utilizing alliance strategy. 0 - 856 870 - - Nan Wang Department of Industrial Engineering and Management, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan Taiwan cn.wang@kuas.edu.tw - - Tho Nguyen Department of Industrial Engineering and Management, National Kaohsiung University of Applied Sciences, Kaohsiung, Taiwan Taiwan nguyenhanam188@gmail.com - - Hoan Nguyen Faculty of Economics - Social, Hanoi University of Business and Technology, Hanoi, Vietnam Viet Nam halynguyen188@gmail.com Strategic alliance Auto industry Grey Data envelopment analysis Brouthers K.D. and Bamossy G.J. (2006). Post-formation processes in eastern and western European joint ventures. Journal of Management Studies, Vol. 43, pp. 203-229.##Candace E.Y. and Thomas A.T. (2011). Strategic alliances with competing firms and shareholder value. Journal of Management and Marketing Research, Vol. 6, pp. 1-10.##Chan S.H., Kensinger J.W., Keown A.J. andMartin J.D. (1997). Do strategic alliances create value? Journal of Financial Economics, Vol. 46, pp. 199-221.##Charnes A., Cooper W.W. and Rhodes, E. (1978). Measuring the efficiency of decision making units. Europeans Journal of Operational Research, Vol. 2(6), pp. 429-444.##Cho B.S., Kang S.W. and Cha, S.M. (2006). Trends in telecommunication strategic alliance regulation. Technology Management for the Global Future, Vol.4, pp.1994-2004.##Cravens D.W., Shipp S.H. and Cravens K.S. (1993). Analysis of cooperative inter-organizational relationships, strategic alliance formation, and strategic alliance effectiveness. Journal of Strategic Marketing, Vol. 1(1), pp. 55-70.##Deng J.L. (1982). Control problems of Grey systems. Systems and Control Letters, Vol. 5, pp. 288-294.##Deng J.L. (1989). Introduction to Grey system theory. The Journal of Grey System, Vol. 1, pp. 124.##Golany B. and Roll Y. (1989). An application procedure for DEA. Omega, Vol. 17(3), pp. 237-250.##Haugh D., Mourougane A. and Chatal O. (2010). The Auto industry in and beyond the crisis,OECD Economics Department Working Papers, No. 745, OECD Publishing, Paris., DOI: http://dx.doi.org/10.1787/5kmmp8wg6cmq-en.##James D. B., Benjamin G.C. and Michael S.R. (2003). Mastering alliance strategy, John Wiley & Sons, Inc., United States of America, pp. 1-19.##Kauser S. and Shaw V. (2004). International strategic alliances: objectives, motives and success. Journal of Global Marketing, Vol. 17(2-3), pp. 7-43.##Lo F.Y., Chien C.F. and Lin, J.T. (2001). A DEA study to evaluate the relative efficiency and investigate the district reorganization of the Taiwan power company. IEEE Transactions on Power Systems, Vol. 16(1), pp. 170-178.##Mart n J.C. and Roman, C. (2001). An application of DEA to measure the efficiency of Spanish airports prior to privatization. Journal of Air Transport Management, Vol. 7(3), pp. 149-157.##Stevenson W.J. and Sum C.C. (2010). Operations management: an Asian perspective. McGrawHill Education (Asia).##Tone K. (2002). A slacks-based measure of super-efficiency in data envelopment analysis. European Journal of Operational Research, Vol. 143, pp. 32-41.##Tone K.A. (2001). Slacks-based measure of efficiency in data envelopment analysis. European Journal of Operational Research, Vol. 130, pp. 498-509.##Wang C.N., Li K.Z., Ho C.T., Yang K.L. and Wang, C.H. (2007). A model for candidate selection of strategic alliances: case on industry of department store. Second International Conference on Innovative Computing, Information and Control, Vol. 85-85.##Wang R.T., Ho C.T.B. and Oh K. (2010). Measuring production and marketing efficiency using grey relation analysis and data envelopment analysis. International Journal of Production Research, Vol. 48(1), pp. 183-199.##Yuan L.N. and Tian L.N. (2012). A new DEA model on science and technology resources of industrial enterprises. International Conference of Machine Learning and Cybernetics, Vol. 3, pp. 986-990.##Sources from websites##OICA, World ranking of manufacturers, available athttp://www.oica.net/production, 2012.##Top 10 Nissan markets 2012 (2013), available at http://www.nissan-global.com/en/##Nissan recalling over one million vehicles for airbag issue (2014/03/26), available at http://www.reuters.com/article/##Nisan annual report 2013, available at http://www.nissan-global.com/en/##Bloomberg Business Week, available at http://www.business-week.com/##
1 - A Flexible Job Shop Scheduling Problem with Controllable Processing Times to Optimize Total Cost of Delay and Processing http://www.ijsom.com/article_2469.html 10.22034/2015.3.04 1 In this paper, the flexible job shop scheduling problem with machine flexibility and controllable process times is studied. The main idea is that the processing times of operations may be controlled by consumptions of additional resources. The purpose of this paper to find the best trade-off between processing cost and delay cost in order to minimize the total costs. The proposed model, flexible job shop scheduling with controllable processing times (FJCPT), is formulated as an integer non-linear programming (INLP) model and then it is converted into an integer linear programming (ILP) model. Due to NP-hardness of FJCPT, conventional analytic optimization methods are not efficient. Hence, in order to solve the problem, a Scatter Search (SS), as an efficient metaheuristic method, is developed. To show the effectiveness of the proposed method, numerical experiments are conducted. The efficiency of the proposed algorithm is compared with that of a genetic algorithm (GA) available in the literature for solving FJSP problem. The results showed that the proposed SS provide better solutions than the existing GA. 0 - 871 887 - - Hadi Mokhtari Department of Industrial Engineering, University of Kashan, Kashan, Iran Iran mokhtari_ie@kashanu.ac.ir - - Mehrdad Dadgar Department of Industrial Engineering, Faculty of Engineering, Tarbiat Modares University, Tehran, Iran Iran dadgaar.m@gmail.com Flexible Job Shop Scheduling Controllable Processing Time Scatter Search Disjunctive Graph Akturk, M.S. and T. Ilhan, (2011) Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness. Computers & Operations Research, Vol. 38(4), pp. 771-781.##Bagheri, A. and M. Zandieh, (2011) Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach". Journal of Manufacturing Systems, 2011. Vol. 30(1), pp. 8-15.##Barzegar, B. and H. Motameni, (2011) Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm". JOURNAL OF ADVANCES IN COMPUTER RESEARCH .##Blum, C. and A. Roli, (2003) Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys (CSUR), Vol. 35(3), pp. 268-308.##Brucker, P. and R. Schlie, (1990) Job-shop scheduling with multi-purpose machines". Computing, Vol. 45(4), pp. 369-375.##Chinneck, J.W., (2004) Practical optimization: a gentle introduction". Electronic document.##Dauzère-Pérès, S. and J. Paulli, (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search". Annals of Operations Research, Vol. 70, pp. 281-306.##Feng, M., et al., (2008) A Grouping Particle Swarm Optimization Algorithm for Flexible Job Shop Scheduling Problem, pp. 332-336.##Garey, M.R., D.S. Johnson, and R. Sethi, (1976) The complexity of flowshop and job-shop scheduling". Mathematics of Operations Research, Vol. 1, pp. 117-129.##Glover, F., M. Laguna, and R. Martí, (2000) Fundamentals of scatter search and path relinking". Control and cybernetics, Vol. 39(3), pp. 653-684.##Glover, F. (1998) A template for scatter search and path relinking. in Artificial evolution. Springer.##Giglio, D. (2015) Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Journal of Scheduling, Vol.18(5), pp. 525-543.##Haq, A.N., et al., (2007) A scatter search approach for general flowshop scheduling problem . The International Journal of Advanced Manufacturing Technology, Vol. 31(7-8), pp. 731-736.##Herroelen, W., B. De Reyck, and E. Demeulemeester, (1998) Resource-constrained project scheduling: a survey of recent developments. Computers & Operations Research, Vol. 25(4), pp. 279-302.##Janiak, A., (1989) Minimization of resource consumption under a given deadline in the two-processor flow-shop scheduling problem. Information Processing Letters, Vol. 32(3), pp. 101-112.##Jiang, S., Liu, M., Hao, J., Qian, W. (2015) A bi-layer optimization approach for a hybrid flow shop scheduling problem involving controllable processing times in the steelmaking industry, Computers and Industrial Engineering, Vol.87, pp. 518-531.##Karabati, S., P. Kouvelis, and G. Yu, (1995) The discrete resource allocation problem in flow lines. Management Science, Vol. 41(9), pp. 1417-1430.##Kayvanfar, V., I. Mahdavi, and G.M. Komaki, (2011) Single machine scheduling with controllable processing times to minimize total tardiness and earliness. Computers & Industrial Engineering.##Koca, E., Yaman, H., Aktürk, M.S. (2015) Stochastic lot sizing problem with controllable processing times, Omega, Vol. 53, pp. 1-10.##Luo, C. (2015) Single machine batch scheduling problem to minimize makespan with controllable setup and jobs processing times, Numerical Algebra, Control and Optimization, Vol. 5(1), pp. 71-77.##Laguna, M., R. Martín, and R.C. Martí, (2003) Scatter search: methodology and implementations in C. Vol. 24.: Springer.##Li, J.-Q., et al., (2010) A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem". The International Journal of Advanced Manufacturing Technology, Vol. 52(5-8), pp. 683-697.##Mokhtari, H., I.N.K. Abadi and A. Cheraghalikhani, (2011a) A multi-objective flow shop scheduling with resource-dependent processing times: Tradeoff between makes pan and cost of resources. Int.J. Prod. Res., Vol. 49, pp. 5851-5875. ##Mokhtari, H., Nakhai Kamal Abadi, I., Zegordi, S.H., (2011b) Production Capacity Planning and Scheduling in a No-Wait Environment with Controllable Processing Times: An integrated modeling approach", Expert Systems with Applications, Vol. 38, pp. 12630-12642. ##Mokhtari, H. (2015) Designing an efficient bi-criteria iterated greedy heuristic for simultaneous order scheduling and resource allocation: a balance between cost and lateness measures", Neural Computing and Applications, Vol. 26, pp. 1085-1101.##Shioura, A., Shakhlevich, N.V., Strusevich, V.A. (2015) Optimal control strategies for single-machine family scheduling with sequence-dependent batch setup and controllable processing times, Mathematical Programming, Vol. 153(2), pp. 495-534.##Shirinivas, S.G., S. Vetrivel, and D. N.M.Elango, (2010) Applications of graph theory in computer science an overview". International Journal of Engineering Science and Technology, Vol. 2(9), pp. 4610-4621.##Tay, J.C. and N.B. Ho (2008) Evolving dispatching rules using genetic programming for solving multi-objective flexible job-shop problems". Computers & Industrial Engineering, Vol. 54(3), pp. 453-473.##Vokurka, R.J. and S.W.O. Leary-Kelly, (2000) A review of empirical research on manufacturing flexibility. Journal of Operations Management 2000.##Wang, L., et al . , (2011) An effective artificial bee colony algorithm for the flexible job-shop scheduling problem". The International Journal of Advanced Manufacturing Technology, Vol. 60(1-4), pp. 303-315.##Wang, J.-B., (2006) Single machine scheduling with common due date and controllable processing times". Applied Mathematics and Computation, Vol. 174(2), pp. 1245-1254.##Xia, W. and Z. Wu, (2005) An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers & Industrial Engineering, Vol. 48(2), pp. 409-425.##Yin, P.-Y., et al., (2010) Cyber swarm algorithms–improving particle swarm optimization using adaptive memory strategies. European Journal of Operational Research, Vol. 201, pp. 377-389.##Zhang, G., L. Gao, and Y. Shi, (2011) An effective genetic algorithm for the flexible job-shop scheduling problem. Expert Systems with Applications, Vol. 38(4), pp. 3563-3573.##Zribi, N., et al., (2006) Minimizing the total tardiness in a flexible job-shop. World Automation Congress.##
1 - Inventory Model for Deteriorating Items Involving Fuzzy with Shortages and Exponential Demand http://www.ijsom.com/article_2543.html 10.22034/2015.3.05 1 This paper considers the fuzzy inventory model for deteriorating items for power demand under fully backlogged conditions. We define various factors which are affecting the inventory cost by using the shortage costs. An intention of this paper is to study the inventory modelling through fuzzy environment. Inventory parameters, such as holding cost, shortage cost, purchasing cost and deterioration cost are assumed to be the trapezoidal fuzzy numbers. In addition, an efficient algorithm is developed to determine the optimal policy, and the computational effort and time are small for the proposed algorithm. It is simple to implement, and our approach is illustrated through some numerical examples to demonstrate the application and the performance of the proposed methodology. 0 - 888 904 - - Sharmila Vijai Stanly The Gandhigram Rural Institute, Deemed University, Gandhigram, India India banadict16@gmail.com - - R Uthayakumar The Gandhigram Rural Institute, Deemed University, Gandhigram, India India uthayagri@gmail.com Exponential Demand Deterioration Shortages Trapezoidal Fuzzy Numbers Fuzzy Demand Fuzzy Deterioration Aggarwal, S. P. and Jaggi, C. K. (1995) Ordering policies of deteriorating items under permissible delay in payments, Journal of the Operational Research Society, Vol.46, pp. 658-662.##Chandrasekhara Reddy, B. and Ranganatham, G. (2012).An EOQ Model with Exponentially Increasing Demand fewer than Two Levels of Storage, Journal of perspective- Gurgaon, Vol.16, pp. 121-127.##Chang, H. J. and Dye, C. Y. (2001). An inventory model for deteriorating items with partial backlogging and permissible delay in payments, International Journal of Systems Science, Vol. 32, pp. 345-352.##Chang, H. J., Hung, C. H. and Dye, C. Y. (2001). An inventory model for deteriorating items with linear trend demand under the condition of permissible delay in payments, Production Planning & Control, Vol. 12, pp. 274-282.##Chang, C. T., Teng, J. T. and Goyal, S.K. (2008). Inventory lot-size models under trade credits: a review, Asia-Pacific Journal of Operational Research, Vol. 25, pp. 89-112. ##Chang, C. T., Wu, S. J. and. Chen, L. C. (2009). Optimal payment time with deteriorating items under inflation and permissible delay in payments, International Journal of Systems Science, Vol. 40. pp. 985-993.##Dutta, D. and Pavan Kumar. (2013). Fuzzy Inventory Model for Deteriorating Items with Shortages under Fully Backlogged Condition, International Journal of Soft Computing and Engineering (IJSCE), Vol.3, pp. 393-398.##Goyal, S. K. (1985). Economic order quantity under conditions of permissible delay in payments, Journal of the Operational Research Society, Vol. 36, pp. 335-338.##Halkos, G. and Kevork, I. (2012). Validity and precision of estimates in the classical newsvendor model with exponential and Rayleigh demand, MPRA Paper No. 36460, posted 6. 12:22 UTC.##Halkos, G. and Kevork, I. (2013). Evaluating alternative frequentist inferential approaches for optimal order quantities in the newsvendor model under exponential demand, International transactions in Operational research Vol. 20, pp. 837–857.##Horng-Jinh Chang and Chung-Yuan Dye. (1999). An EOQ Model for Deteriorating Items with Exponential Time-Varying Demand and Partial Backlogging, Information and Management Sciences, Vol. 10, pp. 1-11.##Hwang, H. and Shinn, S. W. (1997). Retailer’s pricing and lot sizing policy for exponentially deteriorating products under the conditions of permissible delay in payments, Computers & Operations Research, Vol. 24, pp. 539-547.##Jaggi, C. K., Pareek, S., Sharma, A. and Nidhi, A. (2012). Fuzzy inventory model for deteriorating items with time varying demand and shortages, American Journal of Operational Research, Vol. 2, pp. 81-92.##Jamal, A. M. M., Sarker, B. R. and Wang, S. (1997). An ordering policy for deteriorating items with allowable shortages and permissible delay in payments, Journal of the Operational Research Society, Vol. 48, pp. 826-833.##Kapil Kumar Bansal and Navin Ahalawat. (2012). Integrated Inventory Models for Decaying Items with Exponential Demand under Inflation, International Journal of Soft Computing and Engineering, Vol.2, pp. 578-587.##Liang, Y. and Zhou, F. (2011). A two-warehouse inventory model for deteriorating conditionally permissible delay in payment, Applied Mathematical Modelling, Vol. 35, pp. 2221-2231.##Maragatham, M. and Lakshmidevi, P. K. (2014). A Fuzzy Inventory Model for Deteriorating Items with Price Dependent Demand, Intern. J. Fuzzy Mathematical Archive, Vol. 5, pp. 39-47.##Mary Latha, K. F. and Uthayakumar, R. (2014). An Inventory Model for Increasing Demand with Probabilistic Deterioration, Permissible Delay and Partial Backlogging, International Journal of Information and Management Science, Vol. 25, pp. 297-316. ##Nithya, K. and Ritha, W. (2012). Fuzzy Economic Order Quantity for Items with Imperfect Quality and Inspection Errors in an Uncertain Environment on Fuzzy Parameters, Journal of Informatics and Mathematical Sciences, Vol.4, pp. 269–283.##Nirmal Kumar Duari and Prof. Tripti Chakraborty. (2012). A Marketing Decision Problem in a Periodic Review Model with Exponential Demand and Shortages, IOSR Journal of Mathematics, Vol.1, pp. 35-38.##Raafat, F. (1991), Survey of literature on continuously deteriorating inventory models, Journal of the Operational Research Society, Vol. 42, pp. 27-37.##Ritha, W. and Rexlin Jeyakumari, S. (2013). Fuzzy Inventory model for Imperfect quality items with shortages, Annals of pure and applied Mathematics, Vol. 4, pp. 127-137.##Sarah Ryan, M. (2003). Capacity Expansion for Random Exponential Demand Growth with Lead Times, for publication in Management Science, Vol.50, pp. 1-23.##Sanhita, B and Tapan Kumar, R. (2012). Arithmetic Operations on Generalized Trapezoidal Fuzzy Number and its Applications, Turkish Journal of Fuzzy Systems. An Official Journal of Turkish Fuzzy Systems Association, Vol.3, pp. 16-44.##Savitha Pathak and Seema Sarkar (Mondal). (2012). Fuzzy Inventory Models of Perishable Multi-items for Integrated and Non-integrated Businesses with Possibility/Necessity Measure of Trapezoidal Fuzzy Goal, International Journal of Modelling and Optimization, Vol. 2, pp. 119-129.##Shah, N. H. (1993).Probabilistic time-scheduling model for an exponentially decaying inventory when delay in payments is permissible, International Journal of Production Economics, Vol. 32, pp. 77-82.##Shah, N. H. (2006). Inventory mode for deteriorating items and time value of money for a finite time horizon under permissible delay in payments, International Journal of Systems Science, Vol. 37, pp. 9-15.##Soni, H., Gor, A. S. and Shah, N. H. (2006) An EOQ model for progressive payment scheme under DCF approach, Asia-Pacific Journal of Operational Research, Vol. 23, pp. 500-524.##Sushil Kumar. and Rajput, U. S. 2015. Fuzzy Inventory Model for Deteriorating Items with Time Dependent Demand and Partial Backlogging, Scientific Research Publishing, Applied Mathematics, Vol. 6, pp. 496-509.##Syed, J. K. and Aziz, L. A. (2007). Fuzzy Inventory model without shortages using signed distance method, Applied Mathematics and Information Sciences an International Journal, Vol. 1, pp. 203-209.##
1 - An Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation http://www.ijsom.com/article_2545.html 10.22034/2015.3.06 1 In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSGS) is considered as the decoding procedure. In this paper, a simple, efficient fitness function is proposed which has better performance compared to the other fitness functions in the literature. Defining a new mutation operator for ML is the other contribution of the current study. Comparing the results of the proposed GA with other approaches using the well-known benchmark sets in PSPLIB validates the effectiveness of the proposed algorithm to solve the MRCPSP. 0 - 905 924 - - Mohammad Hassan Sebt Amirkabir University of Technology, Tehran, Iran Iran sebt@aut.ac.ir - - Mohammad Reza Afshar Amirkabir University of Technology, Tehran, Iran Iran m.afshar67@aut.ac.ir - - Yagub Alipouri Amirkabir University of Technology, Tehran, Iran Iran yalipouri@aut.ac.ir Combinatorial optimization Multi-mode project scheduling Resource constraints Genetic Algorithm Random key representation Alcaraz J. Maroto C. and Ruiz, R. (2003). Solving the multi-mode resource-constrained project scheduling problem with genetic algorithms. Journal of the Operational Research Societ, Vol. 54, pp. 614–626.##Anderson E. and Ferris M. (1994). Genetic algorithm for combinatorial optimization: assembly line balancing problem. Operations Research Society of America journal on computing, Vol. 6, pp. 161–173.##Beşikci U. Bilge Ü. and Ulusoy, G. (2015). Multi-mode resource constrained multi-project scheduling and resource portfolio problem. European Journal of Operational Research, Vol. 240 (1), pp. 22-31.##Chaleshtari A.S. and Shadokh S. (2014). A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resource with pre-scheduled procurement Arabian Journal of Science Engineering, Vol. 39, pp. 8359- 8369.##Cheng, J. Fowler, J. Kempf, K. and Mason, S. (2015). Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting. Computers & Operations Research, Vol. 53, pp. 275-287.##Damak N. Jarboui, B. Siarry, P. and Loukil, T. (2009). Differential evolution for solving multi-mode resource constrained project scheduling problems. Computers and Operations Research, Vol. 36, pp. 2653-2659.##Drexl A. and Grünewald J. (1993). Nonpreemptive multi-mode resource-constrained project scheduling. IIE Transactions, Vol. 25, pp. 74–81.##Elloumi S. and Fortemps P. (2010). A hybrid rank-based evolutionary algorithm applied to multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, Vol. 205, pp. 31–41.##Eschelman L., Caruana R. and Schaffer D. (1989). Biases in the Crossover Landscape. Proc. third international conference on genetic algorithms, Morgan Kaufman Publishing, February, pp. 21-29.##Glover F. and Greenberg H.J. (1989). New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence. European Journal of Operational Research, Vol. 39, pp. 119-130.##Guangqiang Li, G. Zhao F. Guo C. and Teng H. (2006). Parallel Hybrid PSO-GA Algorithm and Its Application to Layout Design. ICNC 2006, Part I, LNCS 4221, pp. 749–758.##Haoa X. Linb L. Gen M. (2014). An Effective Multi-objective EDA for Robust Resource Constrained Project Scheduling with Uncertain Durations. Procedia Computer Science, Vol. 36, pp. 571-578.##Hartmann S. (2001). Project scheduling with multiple modes: A genetic algorithm. Annals of Operations Research, Vol. 102, pp. 111–135.##Hartmann S. and Briskorn D. (2009). A survey of variants and extensions of the resource-constrained project scheduling problem. European Journal of Operational Research, Vol. 207, pp. 1-14.##Hartmann S. and Drexl A. (1998). Project scheduling with multiple modes: A comparison of exact algorithms. Networks, Vol. 32, pp. 283–297.##Hartmann S. and Sprecher A. (1996). A note on `Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, Vol. 94, pp. 377-383.##Jo´zefowska J. Mika M. Rozycki, R. Waligora G. and Weglarz J. (2001). Simulated annealing for multi-mode resource-constrained project scheduling. Annals of Operations Research, Vol. 102, pp. 137–155.##Juang C.F. (2004). A Hybrid of Genetic Algorithm and Particle Swarm Optimization for Recurrent Network Design. IEEE TRANSACTIONS ON SYSTEMS, Vol. 34 (2), pp. 997-1006. ##Kao Y.T. and Zahara E. 2008. “A hybrid genetic algorithm and particle swarm optimization for multimodal functions. Applied Soft Computing, Vol. 8, pp. 849–857. ##Kolisch R. and Drexl A. (1997). Local search for non-preemptive multi-mode resource constrained project scheduling. IIE Transactions, Vol. 29, pp. 987–999. ##Lee K. and El-Sharkawi M. (2008). Modern heuristic optimization techniques. ##Lova, A., Tormos P. and Barber F. (2006). Multi-mode resource constrained project scheduling: Scheduling schemes, priority rules and mode selection rules. Inteligencia Artificial, Vol. 30, pp. 69–86.##Lova A., Tormos P. Cervantes M. and Barber F. (2009). An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes. International Journal of Production Economics, Vol. 117 (2), pp. 302–316.##Marco A. and Stützle T. (2008). Convergence behavior of the fully informed particle swarm optimization algorithm. Proceedings of the 10th annual conference on Genetic and evolutionary computation, January, pp.71-78.##Mendes J., Gonçalves J. and Resende M. (2009). A random key based genetic algorithm for the resource constrained project scheduling problem. Computers and Operations Research, Vol. 36, pp. 92–109.##Mendes R., Kennedy J. and Neves J. (2004). The Fully Informed Particle Swarm: Simpler, Maybe Better. IEEE Transactions on Evolutionary Computation:, pp. 204-210.##Montgomery D.C. (2005). Design and analysis of experiments. Arizona, John Wiley & Sons Press.##Mori M. and Tseng C. (1997). A genetic algorithm for multi-mode resource constrained project scheduling problem. European Journal of Operational Research, Vol. 100, pp. 134–141.##Özdamar L. 1999. A genetic algorithm approach to a general category project scheduling problem. IEEE Transactions on Systems, Vol. 29, pp. 44–59.##Patterson J.H., Słowinski R. Talbot F. and Weglarz J. (1989). An algorithm for a general class of precedence and resource constrained scheduling problems. Advances in Project Scheduling, pp. 3–28.##Peteghem V.V. and Vanhoucke M. (2009). An artificial immune system for the multi-mode resource-constrained project scheduling problem. In: EvoCOP, Springer.##Peteghem V.V. and Vanhoucke M. (2010). A genetic algorithm for the preemptive and non-preemptive multi-mode resource-constrained project scheduling problem. European Journal of Operational Research, Vol. 201, pp. 409–418. ##Peteghem V.V. and Vanhoucke M. (2014). An experimental investigation of metaheuristics for the multi-mode resource-constrained project scheduling problem on new dataset instances. European Journal of Operational Research, Vol. 235 (1), pp. 62–72.##Qi J.J. Liu, Y.J. Lei H.T. and Guo B. (2014). Solving the multi-mode resource availability cost problem in project scheduling based on modified particle swarm optimization. Arabian Journal of Science Engineering, Vol. 39, pp. 5279- 5288.##Ranjbar M. Reyck B. and Kianfar F. (2009). “A hybrid scatter search for the discrete time/resource trade-off problem in project scheduling. European Journal of Operational Research, Vol. 193 (1), pp. 35–48.##Slowinski R. (1980). Two approaches to problems of resource allocation among project activities – A comparative study. Journal of Operational Research Society, Vol. 8, pp. 711–723.##Slowinski R. Soniewicki B. and Weglarz J. (1994). DSS for multi-objective project scheduling. European Journal of Operational Research, Vol. 79, pp. 220–229.##Spears W. and De Jong K. (1991). On the virtues of parameterized uniform crossover. In: Proceedings of the fourth international conference on genetic algorithms, February, pp. 230–236.##Speranza M.G. and Vercellis C. (1993). Hierarchical models for multi-project planning and scheduling. European Journal of Operational Research, Vol. 64, pp. 312-325.##Sprecher A. (1994). Resource-constrained project scheduling: exact methods for the multi-mode case. Lecture Notes in Economics and Mathematical Systems.##Sprecher A. and Drexl A. (1998). Solving multi-mode resource-constrained project scheduling problems by a simple, general and powerful sequencing algorithm. European Journal of Operational Research, Vol. 107, pp. 431–450.##Sprecher A. Hartmann S. and Drexl A. (1997). An exact algorithm for project scheduling with multiple modes. OR Spektrum. Organ der Deutschen Gesellschaft fur Operations Research, Vol. 19 (3), pp. 195-203.##Talbot F.B . 198 Management Science, Vol. 28, pp. 1197–1210.##Tseng L.Y. and Chen S.C. (2009). Two-phase genetic local search algorithm for the multi-mode resource-constrained project scheduling problem. IEEE Transactions on Evolutionary Computation, Vol. 13 (4), pp. 848–57.##Wang L. and Fang C. (2011). An effective shuffled frog-leaping algorithm for multi-mode resource-constrained project scheduling problem. Information Sciences, Vol. 181, pp. 4804–4822.##Wang L. and Fang C. (2012). An effective estimation of distribution algorithm for the multi-mode resource-constrained project scheduling problem. Computers and Operations Research, Vol. 39: 449–460.##Wauters T. Verbeeck K. Berghe G. and De Causmaecker P.(2009). A multi-agent learning approach for the multi-mode resource-constrained project scheduling problem. In: Proceedings of the 8th International Conference on Autonomous Agents and Multi agent Systems, June, pp. 1-8.##Zhang H. (2012). Ant Colony Optimization for Multimode Resource-Constrained Project Scheduling.” American Society of Civil Engineers, Vol. 28, pp. 150-159.##Zhu G., Bard J. and Tu G. (2006). A branch-and-cut procedure for the multimode resource-constrained project-scheduling problem. Journal on Computing, Vol. 18 (3), pp. 377–39.##
1 - A Stochastic Programming Approach for a Multi-Site Supply Chain Planning in Textile and Apparel Industry under Demand Uncertainty http://www.ijsom.com/article_2544.html 10.22034/2015.3.07 1 In this study, a new stochastic model is proposed to deal with a multi-product, multi-period, multi-stage, multi-site production and transportation supply chain planning problem under demand uncertainty. A two-stage stochastic linear programming approach is used to maximize the expected profit. Decisions such as the production amount, the inventory level of finished and semi-finished product, the amount of backorder and the quantity of products to be transported between upstream and downstream plants in each period are considered. The robustness of production supply chain plan is then evaluated using statistical and risk measures. A case study from a real textile and apparel industry is shown in order to compare the performances of the proposed stochastic programming model and the deterministic model. 0 - 925 946 - - Houssem Felfel National Engineering School of Sfax (ENIS), University of Sfax, Tunisia Tunisia houssem.felfel@gmail.com - - Omar Ayadi National Engineering School of Sfax (ENIS), University of Sfax, Tunisia Tunisia omar.ayadi@yahoo.fr - - Fawzi Masmoudi National Engineering School of Sfax (ENIS), University of Sfax, Tunisia Tunisia faouzi.masmoudi@enis.rnu.tn Multi-site Supply chain planning Stochastic programming Textile Robustness Awudu, I., & Zhang, J. (2013).Stochastic production planning for a biofuel supply chain under demand and price uncertainties. Applied Energy, Vol. 103, pp. 189-19.##Birge, J. R., & Louveaux, F. (1997). Introduction to Stochastic Programming. New York: Springer.##Chopra, S., & Meindl, P. (2010). Supply chain management: Strategy, planning, and operation(4th ed.). Pearson Education, Inc : Upper Saddle River, New Jersey.##Dantzig, G. B. (1955). Linear programming under uncertainty. Management Science, Vol. 1, pp. 197.##Felfel, H., Ayadi, O., & Masmoudi, F. (2014). Multi-objective Optimization of a Multi-site Manufacturing Network. Lecture Notes in Mechanical Engineering, pp. 69-76.##Gupta, A., & Maranas, C. D. (2000). A Two-Stage Modeling and Solution Framework for Multisite Midterm Planning under Demand Uncertainty. Industrial & Engineering Chemistry Research, Vol.39, pp. 3799-3813.##Lin J.T., & Chen Y.Y. (2007). A Multi-site Supply Network Planning Problem Considering Variable Time Buckets - A TFT-LCD Industry Case. International Journal of Advanced Manufacturing Technology, Vol. 33(9-10), pp. 1031-1044.##Kall, P. & Wallace, S.W. (1994). Stochastic Programming. John Wiley and Sons: Chichester.Karabuk, S. (2008).Production planning under uncertainty in textile manufacturing.Journal of the Operational Research Society, Vol. 59(4), pp. 510-520.##Leung, S. C. H., Wu, Y., & Lai, K. K. (2003). Multi-site aggregate production planning with multiple objectives: A goal programming approach. Production Planning & Control: The Management of Operations, Vol.14(5), pp. 425-436.##Leung, S. C. H., Wu, Y., & Lai, K. K. (2006). A stochastic programming approach for multi-site aggregate production planning. Journal of the Operational Research Society,Vol. 57, pp. 123-132.##Lin, J. T., Wu, C.H., Chen, T.L., & Shih, S.H. (2011). A stochastic programming model for strategic capacity planning in thin film transistor-liquid crystal display (TFT-LCD) industry. Computers & Operations Research, Vol. 38, pp. 992–1007.##Mirzapour Al-e-hashem, S. M. J, Baboli, A., Sadjadi, S. J., &Aryanezhad, M. B. (2011a). A Multiobjective Stochastic Production-Distribution Planning Problem in an Uncertain Environment Considering Risk and Workers Productivity. Mathematical Problems in Engineering, Article ID 406398, doi:10.1155/2011/406398.##Mirzapour Al-e-hashem, S. M. J., Malekly, H., &Aryanezhad, M. B.(2011b).A multi-objective robust optimization model for multi-product multi-site aggregate production planning in a supply chain under uncertainty. International Journal of Production Economics, Vol. 134(1), pp. 28–42.##Nagar, L., & Jain, K. (2008). Supply chain planning using multi-stage stochastic programming. Supply Chain Management: An International Journal, Vol. 13(3), pp. 251-256.##Sahinidis, N. V. (2004). Optimization under uncertainty: state-of-the-art and opportunities. Computers and Chemical Engineering, Vol. 28 (6-7), pp. 971-983.##Shah, N. K., & Ierapetritou, M. G. (2012). Integrated production planning and scheduling optimization of multisite, multiproduct process industry. Computers and Chemical Engineering, Vol. 37, pp. 214-226.##Toni, A. D., & Meneghetti, A. (2000).The production planning process for a network of Firms in the textile-apparel industry. Int. J. Production Economics,Vol. 65, pp. 17-32.##Topaloglou, N., Vladimirou, H., & Zenios, S. A. (2002). CVaR models with selective hedging for international asset allocation. Journal of Banking & Finance,Vol. 26(7), pp. 1535-1561.##Vin J. P., & Ierapetritou M. G. (2001). Robust Short-Term Scheduling of Multiproduct Batch Plants under Demand Uncertainty. Industrial & Engineering Chemistry Research, Vol. 40, pp. 4543-4554.##