TY  - JOUR
T1  - AÇIK ATÖLYE TİPİ ÇİZELGELEME PROBLEMLERİNİN PARALEL KANGURU ALGORİTMASI İLE ÇÖZÜMÜ
AU  - Baysal, M. Emin
AU  - Durmaz, Taha
AU  - Sarucan, Ahmet
AU  - Engin, Orhan
PY  - 2013
DA  - March
JF  - Gazi Üniversitesi Mühendislik Mimarlık Fakültesi Dergisi
JO  - GUMMFD
PB  - Gazi Üniversitesi
WT  - DergiPark
SN  - 1300-1884
SP  - 0
VL  - 27
IS  - 4
LA  - tr
AB  - Açık Atölye Tipi Çizelgeleme (AATÇ) problemi temelde, her bir işin her makinede işlem görmesi gerekensadece bir işleminin bulunduğu ve işlem sırasının önemli olmadığı bir çizelgeleme problemidir. Çoğunluklabenzer ürün gruplarının üretildiği tesislerde görülmektedir. Bu çalışmada, AATÇ problemleri toplamtamamlanma zamanının minimizasyonuna yönelik, rassal zıplama tekniği ile işleyen Paralel KanguruAlgoritması (PKA) ile çözülmüştür. PKA, sürekli daha iyi çözümlere ulaşmaya çalışan meta-sezgisel biryöntemdir. Literatürde yer alan AATÇ; kıyas problemleri, vahşi ve evcil iki kanguru operatörünün paralelçalıştırıldığı, Kanguru Algoritması (KA) ile çözülmüştür. Elde edilen değerler, literatürde daha önce ulaşılan eniyi sonuçlar ile karşılaştırılmıştır. PKA’nın AATÇ problemlerinin çözümünde etkin bir yöntem olduğubelirlenmiştir.
KW  - Açık atölye tipi çizelgeleme
KW  - paralel kanguru algoritması
KW  - tamamlanma zamanı.
CR  - Liaw, C.F., Cheng, C.Y., Chen, M., “The total
CR  - completion time open shop scheduling problem
CR  - with a given sequence of jobs on one machine”,
CR  - Computers & Operations Research, 29, 1251
CR  - – 1266, 2002.
CR  - Durmaz, T., Açık Atölye Çizelgeleme
CR  - Problemlerinin Paralel Kanguru Algoritması
CR  - ile Çözümü, Yüksek Lisans Tezi, Selçuk
CR  - Üniversitesi, Fen Bilimleri Enstitüsü, 2011.
CR  - Gonzalez, T., Sahni, S., “Open shop scheduling
CR  - to minimize finish time”, Journal of the ACM,
CR  - (4):665–79, 1976.
CR  - Arıkan, M., Erol, S., “A long term memory tabu
CR  - search algorithm for part selection and machine
CR  - loading in flexible manufacturing systems”,
CR  - Journal of The Faculty of Engineering and
CR  - Architecture of Gazi University, 25, 2, 311-
CR  - , 2010.
CR  - Dereli, T., Daş, G. S., “Ant colony optimization
CR  - approach for container loading problems”,
CR  - Journal of The Faculty of Engineering and
CR  - Architecture of Gazi University, 25, 4, 881-
CR  - , 2010
CR  - Liaw, C.F., “An efficient tabu search approach
CR  - for the two-machine preemptive open shop
CR  - scheduling problem”, Computers &
CR  - Operations Research, 30, 2081–2095 2003.
CR  - NG, C.T., Cheng, T.C.E., Yuan, J.J., “Concurrent
CR  - Open Shop Scheduling to Minimize the
CR  - Weighted Number of Tardy Jobs”, Journal of
CR  - Scheduling, 6, 405 – 412, 2003.
CR  - Blum, C., “Beam-ACO—hybridizing ant colony
CR  - optimization with beam search: an application
CR  - to open shop scheduling”, Computers &
CR  - Operations Research, 32, 1565–1591, 2005.
CR  - Shabtay, D., Kaspi, M., “Minimizing the
CR  - Makespan in Open-Shop Scheduling Problems
CR  - with a Convex Resource Consumption
CR  - Function,” Wiley InterScience (2 February
CR  - .
CR  - Senthilkumar, P., Shahabudeen, P., “GA based
CR  - heuristic for the open job shop scheduling
CR  - problem”, Int J Adv Manuf Technol, 30, 297–
CR  - , 2006.
CR  - Sedeno-Noda, A., Alcaide, D., Gonzalez-
CR  - Martin, C., “Network flow approaches to preemptive
CR  - open-shop scheduling problems with time-windows”, European Journal of
CR  - Operational Research, 174, 1501–1518, 2006.
CR  - Gribkovskaia, I.V., Lee, C.Y., Strusevich, V.A.,
CR  - Werra, D., “Three is easy, two is hard: open
CR  - shop sum-batch scheduling problem refined”,
CR  - Operations Research Letters, 34, 459 – 464,
CR  - Sha, D.Y., Hsu, C.Y., “A new particle swarm
CR  - optimization for the open shop scheduling
CR  - problem”, Computers & Operations
CR  - Research, 35 3243 – 3261, 2008.
CR  - Brasel, H., Herms, A., Mörig, M., Tautenhahn,
CR  - T., Tusch, J., Werner, F., “Heuristic
CR  - constructive algorithms for open shop
CR  - scheduling to minimize mean flow time”,
CR  - European Journal of Operational Research,
CR  - , 856–870, 2008.
CR  - Lin, H.T., Lee, H.T., Pan, W.J., “Heuristics for
CR  - scheduling in a no-wait open shop with movable
CR  - dedicated machines”, Int. J. Production
CR  - Economics, 111, 368–377, 2008.
CR  - Mosheiov, G., Oron, D., “Open-shop batch
CR  - scheduling with identical jobs”, European
CR  - Journal of Operational Research, 187, 1282–
CR  - , 2008.
CR  - Werra, D., Kis, T., Kubiak, W., “Preemptive
CR  - open shop scheduling with multiprocessors:
CR  - polynomial cases and applications”, J Sched 11,
CR  - –83, 2008.
CR  - Sedeño-Noda, A., Pablo, D.A.L., González-
CR  - Martín, C., “A network flow-based method to
CR  - solve performance cost and makespan openshop
CR  - scheduling problems with time-windows”,
CR  - European Journal of Operational Research,
CR  - , 140–154, 2009.
CR  - Low, C. ve Yeh, Y., “Genetic algorithm-based
CR  - heuristics for an open shop scheduling problem
CR  - with setup, processing, and removal times
CR  - separated”, Robotics and Computer-
CR  - Integrated Manufacturing, 25, 314–322,
CR  - Akgöbek, Ö., Kaya, S., Değirmenci, Ü., Engin,
CR  - O., “Açık Atölye Tipi Çizelgeleme
CR  - Problemlerinin Paralel Doyumsuz Metasezgisel
CR  - Algoritma ile Çözümü”, Bilimde Modern
CR  - Yöntemler Sempozyumu – BMYS 2010, 14-
CR  - Ekim Dicle Üniversitesi Kongre Merkezi,
CR  - -130, 2010.
CR  - Naderi, B., Ghomi, S.M.T.F., Aminnayeri, M.,
CR  - Zandieh, M., “A contributon and new heuristics
CR  - for open shop scheduling”, Computers &
CR  - Operations Research, 37, 213-221, 2010.
CR  - Zhang, X. ve Velde, S., “On-line two-machine
CR  - open shop scheduling with time lags”,
CR  - European Journal of Operational Research,
CR  - 14–19, 2010.
CR  - Türkeli, B., “Solution of Bicriteria Open Shop
CR  - Scheduling Problem with Genetic Algorithm
CR  - and Tabu Search and Detailed Analysis of
CR  - Results”, Yüksek Lisans Tezi, Marmara
CR  - University Institute For Graduate Studies In
CR  - Pure And Applied Sciences, İstanbul, 2010.
CR  - Kökçam, A.H. ve Engin, O., “Bulanık Proje
CR  - Çizelgeleme Problemlerinin Meta Sezgisel
CR  - Yöntemlerle Çözümü”, Mühendislik ve Fen
CR  - Bilimleri Dergisi (Sigma), 28, 86-101, 2010.
CR  - Serbencu, A., Minzu, V., Serbencu, A., “An Ant
CR  - Colony System Based Metaheurıstic for Solving
CR  - Single Machine Scheduling Problem”, The
CR  - Annals of “Dunarea De Jos” Unıversity Of
CR  - Galati Fascicle III, Electrotechnıcs,
CR  - Electronıcs, Automatıc Control, Informatıcs, 19-
CR  - , 2007.
CR  - Teske, E., “Computing discrete logarithms with
CR  - the parallelized kangaroo method”, Discrete
CR  - Applied Mathematics, 130, 61-82, 2003.
CR  - Pollard, J.M., “Kruskal's Card Trick”, The
CR  - Mathematical Gazette, 84, 500 (Jul.), 265-267,
CR  - Jellouli, O., Chatelet, E., “Monte Carlo
CR  - Simulation And Stochastich Algorithms For
CR  - Optimising Supply Chain Management in an
CR  - Uncertain Environment”, Systems, Man, and
CR  - Cybernetics, 2001 IEEE International
CR  - Conference, 3 1840-1844. 2001.
CR  - Stein, A. ve Teske, E., “The Parallelized Pollard
CR  - Kangaroo Method in Real Quadratic Function
CR  - Fields”, Mathematics of Computation, 71/238
CR  - -814, 2001.
CR  - Minzu, V. ve Beldiman, L., “Some aspects
CR  - concerning the implementation of a parallel
CR  - hybrid metaheuristic”, Engineering
CR  - Applications of Artificial Intelligence, 20,
CR  - –999, 2007.
CR  - Yılmaz, M.K., Kökçam, A.H., Duvarcı, V.,
CR  - Fığlalı, A., Ayöz, M., Engin, O., “Paralel
CR  - Kanguru Algoritması Yardımıyla Beklemesiz
CR  - Akış Tipi Çizelgeleme Problemlerinin
CR  - Çözümü”, Yöneylem Araştırması ve Endüstri
CR  - Mühendisliği 29. Ulusal Kongresi, 2010.
CR  - Yılmaz, M.K., Engin, O., Fığlalı, A., Yavuz,
CR  - M., “Parallel Kangaroo Algorithm For Biobjective
CR  - Flow Shop Scheduling with a New
CR  - Weight Combining Approach”, 1st
CR  - International Symposium on Computing in
CR  - Science & Engineering, ISCSE-2010, Gediz
CR  - University (İzmir), June 3-5, Kuşadası Aydın
CR  - Turkey, 823-827, 2010.
CR  - Yılmaz, M.K., Fığlalı, A., Terzi, U., Yavuz, M.,
CR  - Engin, O., “A Hybrid Parallel Kangaroo a
CR  - &Simulated Annealing Algorithm for Multi-
CR  - Objective Flow Shop Scheduling” The Journal
CR  - of Management and Engineering Integration,
CR  - , 2, 2010.
CR  - Guéret, C., Prins, C., “A new lower bound for
CR  - the open-shop problem”, Annals of Operations
CR  - Research, 92:165–83, 1999.
CR  - Guéret, C., Ecole des mines de Nantes – Open
CR  - shop problems [online], Nantes, Ecole des
CR  - mines de Nantes, http://www.minesnantes.
CR  - fr/en/Media/ Elements-Sites-
CR  - Persos/Christelle-Gueret/Openshop/
CR  - HardOSInstances [Ziyaret Tarihi: 3 Ocak
CR  - .
UR  - https://dergipark.org.tr/tr/pub/gazimmfd/issue//88701
L1  - https://dergipark.org.tr/tr/download/article-file/75914
ER  -