Buradasınız

Anasayfa » Content

STOKASTİK MONTAJ HATLARININ KISIT PROGRAMLAMA VE KAPALI KUYRUK AĞLARI İLE DENGELENMESİ

BALANCING STOCHASTIC ASSEMBLY LINES USING CONSTRAINT PROGRAMMING AND QUEUEING NETWORKS

Journal Name:

  • Gazi Üniversitesi Mühendislik-Mimarlık Fakültesi Dergisi

Publication Year:

  • 2013

Key Words:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
As an important component of flow type production systems, assembly lines are widely used from automotive, appliance to apparel industry. In this research, the aim is finding the optimum task assignment that minimizes the cycle time under the assumption that station quantities are constant which are described as Type-2 assembly lines. Stochastic assembly lines are considered in which task times are distributed according to a statistical distribution. A new algorithm which gives optimum solution using Constraint Programming and Queuing Network is proposed. In this algorithm, the possible combinations are determined by Constraint Programming, and then, the performance measures are evaluated by Queuing Network. The method is tested with several numerical experiments from literature and the applicability is confirmed.
Bookmark/Search this post with
Abstract (Original Language): 
Montaj hatları, akış tipi üretim sistemlerinin önemli parçası olarak otomotiv, dayanıklı tüketim mamulleri, konfeksiyon vd. sanayilerde çok yaygın olarak kullanılmaktadır. Bu çalışmada, Tip-2 olarak tanımlanan, istasyon sayısının sabit kabul edilip çevrim süresini minimize edildiği montaj hatlarında optimum görev atamasının bulunması amaçlanmıştır. İşlem sürelerinin belirli bir olasılık dağılımına uygun varsayıldığı stokastik montaj hatları ele alınmıştır. Kısıt programlama ve Kuyruk ağları kullanarak optimum çözümü veren yeni bir algoritma önerilmiştir. Bu algoritmada, Kısıt programlama metodu ile muhtemel görev atama kombinasyonlarını belirlenmiş ve Kuyruk Ağı modeli ile performansları değerlendirilerek en iyi sonuçlar elde edilmiştir. Önerilen metot literatürde bulunan deney setleri ile test edilmiş, yöntemin uygulanabilirliği kanıtlanmıştır.
FULL TEXT (PDF): 
PDF icon arastirmax-stokastik-montaj-hatlarinin-kisit-programlama-kapali-kuyruk-aglari-ile-dengelenmesi.pdf
  • 2
231
240
  • Turkish

REFERENCES

References: 

1. Çerçioğlu, H., Stokastik Paralel Montaj Hattı
Dengeleme Problemi için Yeni Modeller,
Doktora Tezi, Gazi Üniversitesi F.B.E., Ankara,
(2009).
2. Gökçen, H., Karışık Modelli Deterministik
Montaj Hattı Dengeleme Problemleri İçin
Yeni Modeller, Doktora Tezi, Gazi Üniv.,
F.B.E., Ankara, (1994).
3. Scholl, A. ve Becker, C., State-of-the-art exact
and heuristic solution procedures for simple
assembly line balancing, European J. of Oper.
Research, Cilt:168, 666-693, 2006.
4. Scholl, A., Balancing and Sequencing of
Assembly Lines, second ed. Physica-Verlag
Press, Heidelberg, Germany, 1999.
5. Bryton, B., Balancing of a Continuous
Production Line, Yüksek Lisans tezi.
Northwestern University, Northwestern, (1954).
6. Salveson, M. E. The Asssembly Line Balancing
Problem, J. of Industrial Engineering
,Cilt:6,No:3, 18-25, 1955.
7. Helgeson, W., & Birnie, D. Assembly Line
Balancing Using The Ranked Positional Weight
Technique, J. of Ind. Eng. , Cilt:12 No:6, 384-
389, 1961.
8. Ugurdag, H., Rachamadugu, R., Papachristou, C.
A., Designing paced assembly lines with fixed
number of stations, European J. of Operational
Research, Cilt:102, 488-501, 1997.
9. Carnahan, B. J., Norman, B. A., Redfern, M. S.,
Incorporating Physical Demand Criteria into
Assembly Line Balancing. IIE Transactions,
Cilt:33, No:10, 875–887, 2001.
10. Liu, S., Ong, H., Huang, H. A, Bi-directional
Heuristic for Stochastic Assembly Line
Balancing Problems. Int. J. Adv. Manuf.
Technol., Cilt:25: 71-77, 2005.
11. Pastor, R., & Ferrer, L., An improved
mathematical program to solve the simple
assembly line balancing problem, Int. J. of
Production Research, Cilt:47 No:11: 2943–
2959, 2009.
12. Wei, N., & Chao, M., A solution procedure for
type E simple assembly line balancing problem,
Computers & Ind. Eng., Cilt:61, No:3, 824-830,
2011.
13. Nourmohammadia, A., Zandieh, M., Assembly
line balancing by a new multi-objective
differential evolution algorithm based on
TOPSIS. Int. J. of Production Research,
Cilt:49, No:10, 2833–2855, 2011.
14. Modie, C. L., Young, H. H., A heuristic method
of assembly line balancing for assumptions of
H.N. Alağaş ve ark. Stokastik Montaj Hatlarının Kısıt Programlama ve Kapalı Ağları ile Dengelenmesi
240 Gazi Üniv. Müh. Mim. Fak. Der. Cilt 28, No 2, 2013
constant or variable work element times. Journal
of Industrial Engineering, Cilt:16, 23-29, 1965.
15. Gökçen, H., ve Baykoç, Ö., A new line remedial
policy for the paced lines with stochastic task
times, Int. J. of Prod. Economics, Cilt:58, No:2,
191-197, 1999.
16. Ağpak, K., ve Gökçen, H. A chance-constrained
approach to stochastic line balancing. European
J. Of Oper. Res., Cilt:180, No:3, 1098–1115,
2007.
17. Ayazi, S., Hajizadehb, A. E., Nooshabadic, M.
R., Jalaiea, H., ve Moradi, Y., Multi-objective
assembly line balancing using genetic algorithm,
Int. J. of Industrial Engineering
Computations, Cilt:2: No:4, 863–872, 2011
18. Becker, C., ve Scholl, A., A survey on problems
and methods in generalized assembly line
balancing, European J. of Oper. Res., Cilt:168,
694–715, 2006.
19. Boysen, N., Fliedner, M., ve Scholl, A., A
classification of assembly line balancing
problems. European J. of Oper. Res., Cilt:183,
674–693, 2007.
20. Boysen, N., Fliedner, M. ve Scholl, A., Assembly
line balancing: Which model to use when?,
International J. of Prod. Economics, Cilt:111,
509-528, 2008.
21. Topaloglu, S., Salum, L. ve Supciller A.A., Rulebased
modeling and constraint programming
based solution of the assembly line balancing
problem, Expert Systems with Applications,
Cilt:39, No:3, 3484–3493, (2012)
22. Apt, K. R., Principles of Constraint
Programming, Cambridge University Press,
Amsterdam, The Netherlands, 2003.
23. IBM. ILOG CP Optimizer User’s Manual.,2012
24. Bolch G., Greiner S., Meer H, Trivedi K. S.,
Queuing Networks and Markov Chains
Modeling and Performance Evaluation with
Computer Science Applications, John Wiley &
Sons, New Jersey, 2006.
25. Reiser, M., & Lavenberg, S., Mean Value
Analysis For Closed Multi-Chain Queueing
Networks, Journal of A.C.M., Cilt:27, No:2,
313-322, 1980.

Thank you for copying data from http://www.arastirmax.com