Multi-Objective Lead-Time Control Problem with Stochastic Constraints

 

M. Molavi¹, H. Hamzeli² and V.M. Dalfard*³

 

¹ Department of Public Administration, Mahabad Branch Islamic Azad University, Mahabad, Iran.

² Department of Management, Hamedan Branch Islamic Azad University, Hamedan, Iran.

³ Young Researchers and Elite Club, Kermen Branch Islamic Azad University, Kerman, Iran. * vmd_60@yahoo.co.nz

 

Abstract

This research intends to find out any development of a robust multi-objective for lead time optimal control problem in a multi-stage assembly system model. Assembly system modeling is possible by the help of the open queue network. A working station includes one or infinite servers and just manufacturing or assembly operations are performed therein. Each part has a separate entry process and independent of each other. It is completely based upon Poisson process.Serving Lead Time of Stations are also independent of each other and therefore exponential distribution of each parameter is controllable. All stations have bounded uncertain unrecyclable wastes which are completely independent in compliance with Erlang distribution. Uncertainty in the problem parameters has been suggested as robust multi-objective optimal control model in which we have three incompatible target functions including cyclic operation cost minimization, average lead time minimization and lead time variance. Finally, target progress method has been applied in order to achieve serving optimal speeds and solve discrete time of the main problem approximately. The proposed model could present a suitable solution even for the same problem as mentioned in other related papers along with some considerable results in parameter uncertainty conditions.

Keywords: Multi-objective planning, robust optimization, lead time control, queue theory, complex assembly system.

 

DESCARGAR ARTÍCULO EN FORMATO PDF

 

References

[1] Ascencio L.M., R.G. GonzÁ¡lez-RamÁ-rez, L.A. Bearzotti, N.R. Smith and J.F. Camacho-Vallejo, A Collaborative Supply Chain Management System for a Maritime Port Logistics Chain, Journal of Applied Research and Technology, Vol. 12, 3, June 2014.         [ Links ]

[2] Baldoquin M.G. de la PeÁ±a, A. Escalera FariÁ±as and R. Linfati , A Model and Solution Method for Solving the Real-world and Complex Problem of Scheduling Visits to Customers, Journal of Applied Research and Technology, Vol. 12, 3, June 2014.         [ Links ]

[3] Bertsimas, D., Sym, M., .The Price of the Robustness, Operations Research, 52, 2004, pp. 35-53.         [ Links ]

[4] Bertsimas, D., Sym, M., .Robust Discrete Optimization and Network Flows., Mathematical Programming, 98, 2002, pp. 49-71.         [ Links ]

[5] Ben-Tal, A., A. Nemirovski, .Robust Solutions of Linear Programming Problems Contaminated with Uncertain Data., Mathematical Programming. 88, 2000, pp. 411- 424         [ Links ]

[6] Ben-Tal, A., Nemirovski, A., .Robust Solutions to Uncertain Programs., Operations Research Letters 25, 1999, pp. 1-13.         [ Links ]

[7] Ben-Tal, A., Nemirovski, A., .Robust Convex Optimization., Mathematical Operations Research, 23, 1998, pp. 769-805.         [ Links ]

[8] Chen Y. G. , W. Y. Zhang, S. Q. Yang, Z. J. Wang and S. F. Chen, Referral service and customer incentive in online retail supply Chain, journal of Applied Research and Technology, Vol. 12, 2, 2014.         [ Links ]

[9] Dantzig, G.B., .Linear programming under uncertainty, Management Science, 1998, 197-206.         [ Links ]

[10] Dalfard, V.M., Ranjbar, V. (2012) Programiranje vise projekata uz ograniĉena sredstva & Pravila prioriteta primjenom algoritma simuliranog žarenja [Multi-projects scheduling with resource constraints & priority rules by the use of simulated annealing algorithm], Tehnicki Vjesnik, 19 (3), pp. 493-499.         [ Links ]

[11] Dalfard, V.M., Ardakani, A., Banihashemi, T.N. (2011) Hibridni genetski algoritam za planiranje poslova montaze na tekucoj traci s vremenima montaže na tekućoj traci s vremenima za montir anje i transport ovisnima o redoslijedu odvijanja poslova [Hybrid genetic algorithm for assembly flow-shop scheduling problem with sequence-dependent setup and transportation times], Tehnicki Vjesnik, 18 (4), pp. 467-504.         [ Links ]

[12] Dalfard, V.M. (2014) A new intelligence algorithm for determination of shortest path for dynamic guidance of vehicles based on service level criterion, International Journal of Operational Research, 19 (4),497-512, doi:10.1504/IJOR.2014.060411.         [ Links ]

[13] El-Ghaoui, L., Lebret, H., .Robust Solutions to Least-Square Problems to Uncertain Data Matrices., SIAM J.Matrix Anal. Appl. 18, 1997, pp. 1035-1064.         [ Links ]

[14] El-Ghaoui, L., Oustry, F., Lebret, H., .Robust Solutions to Uncertain Semidefnite Programs., SIAM J. Optim. 9, 1998, pp. 33-52.         [ Links ]

[15] Harrison, J.M., .Assembly-Like Queues, Journal of Applied Probability 10, 1973, pp. 354.367.         [ Links ]

[16] Kaveh, M., Dalfard, V.M., Amiri, S. (2014), A new intelligent algorithm for dynamic facility layout problem in state of fuzzy constraints, Neural Computing and Applications, 24 (5), pp. 1179-1190, http://dx.doi.org/10.1007/s00521-013-1339-5.         [ Links ]

[17] Kerbache, L., Smith, J.M., .Multi-Objective Routing Within Large Scale Facilities Using Open Finite Queueing Networks, European Journal of Operational Research 121, 2000, pp. 105.123.         [ Links ]

[18] Kulkarni, V., Adlakha, V., .Markov and Markov-Regenerative PERT Networks., Operations Research 34, 1986, pp. 769.781.         [ Links ]

[19] Lemoine, A.J., .On Total Sojourn Time in Networks of Queues., Management Science 25, 1979, pp. 1034.1035.         [ Links ]

[20] Kouvelis, P., Yu, G., .Robust Discrete Optimization and its Applications, Kluwer Academic Publishers, Norwell, MA, 1997.         [ Links ]

[21] Schechner, Z., Yao, D., .Decentralized Control of Service Rates in a Closed Jackson Network., IEEE Transactions on Automatic Control 34, 1989, pp.236. 240.         [ Links ]

[22] Smith, J.M., Daskalaki, S., .Buffer Space Allocation in Automated Assembly Lines., Operations Research 36, 1988, pp. 343.358.         [ Links ]

[23] Soyster, A.L., .Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming., Operations Research 21, 1973, pp. 1154-1157.         [ Links ]

[24] Tseng, K., Hsiao, M., .Optimal Control of Arrivals to Token Ring Networks with Exhaustive Service Discipline, Operations Research 43, 1995, pp. 89.101.         [ Links ]

[25] Yinan, Qi, Mincong Tang and Min Zhang, Mass Customization in Flat Organization: The Mediating Role of Supply Chain Planning and Corporation Coordination, Journal of Applied Research and Technology, Vol. 12, 2, 2014.         [ Links ]