Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması

Mesut Cemil İŞLER, (Devlet Malzeme Ofisi Genel Müdürlüğü, Ankara, Türkiye)
Bilal TOKLU, (Gazi Üniversitesi, Mühendislik Mimarlık Fakültesi, Endüstri Mühendisliği Bölümü, Ankara, Türkiye)
Veli ÇELİK (Kırıkkale Üniversitesi, Mühendislik Fakültesi, Makine Mühendisliği Bölümü, Kırıkkale, Türkiye)
Mühendislik Bilimleri Dergisi
6 2
Yıl: 2009 Cilt: 15 Sayı: 2 Sayfa Aralığı: 227 - 252 Metin Dili: Türkçe İndeks Tarihi: 29-07-2022

Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması

Öz:
Bir görev veya iş sürekli yapıldığı takdirde belirli bir alışkanlık ve öğrenme olur ve ilerleyen zamanlarda bu işi tamamlamak için gerekli kaynaklara olan (işgücü, malzeme, vb.) ihtiyaç azalır. Bu "Öğrenme Eğrisi" ile ilk kez Wright tarafından tanımlanmıştır. Wright uçakların üretiminde üretilen uçak sayısı artarken direk işçilik maliyetlerinde nasıl bir azalma olduğunu tespit etmiştir. Bu gözlemin doğruluğu uçak üreticileri tarafından da tutarlı bulunmuştur. "Öğrenme Etkisi" ise; aynı veya benzer işlerin tekrarlanmasıyla üretim sürecinde işlerin tekrar sayısı nispetinde daha kısa sürede yapılmasını ifade eden etkidir. Günümüzde klasik üretim sistemlerine yeni yaklaşımlarla çağın gereklerine daha uygun sistemler uyarlanmıştır. Tam Zamanında Üretim Sistemi (TZÜ) felsefesi de en önemli modern üretim felsefelerinden biridir. Stoksuz üretim veya "0" envanter gibi isimlerle de bilinen TZÜ, tüm üretim kaynaklarının optimum kullanımı ilkesine dayanır. Tam zamanında çizelgeleme olarak ta nitelendirebileceğimiz Erken(Earliness)/Geç(Tardiness) tamamlanma cezalarının minimizasyonu problemi TZÜ felsefesinden esinlenerek ortaya çıkmıştır. Bu çalışmada çizelgelemede erken/geç tamamlanma performans kriteri ve öğrenme etkili işleme özelliğinin dikkate alındığı yayınlara yönelik literatür taraması ve sonucunda literatüre yönelik bazı tespitler yapılmıştır
Anahtar Kelime:

A Literature Survey for Earliness/Tardiness Scheduling Problems with Learning Effect

Öz:
When a task or work is done continuously, there will be an experience so following times needs of required resources (manpower, materials, etc.) will be reduced. This learning curve described first by Wright. Wright determined how workmanship costs decreased while proceed plain increasing. This investigations correctness found consistent by plain producers. Learning effect is an effect that, works can be done in shorter time in the rate of repeat of work with repeating same or similar works in production process. Nowadays classical production systems adapted more acceptable systems with new approaches. Just in time production system (JIT) philosophy is one of the most important production system philosophies. JIT which is known production without stock stands on using all product resources optimum. Minimization problem of Earliness/Tardiness finishing penalty, which we can describe Just in time scheduling, appeared by inspired from JIT philosophy. In this study, there is literature survey which directed to earliness/tardiness performance criteria and learning effect processing in scheduling and as a result of this it is obtained some establishing for literature
Anahtar Kelime:

Belge Türü: Makale Makale Türü: Araştırma Makalesi Erişim Türü: Erişime Açık
  • Abdul-Razaq, T. and Potts, C. 1988. Dynamic program-ming state-space relaxation for single-machine scheduling, Journal of Operational Research Soci-ety. (39), 141-152.
  • Acar, N. 2002. Tam Zamanında Üretim, MPM Yayınları No: 542. Ankara.Adamopoulos, G.I. and Pappis, C.S. 1998. Scheduling under a common due date on parallel unrelated machines, European Journal of Operational Re-search. (105), 495-501.
  • Alidaee, B., Kochenberger, G.A. and Ahmadian, A. 1994. Minimization total absolute flow time de-viation in single and multiple machine schedul-ing, The Journal of the Operational Research Soci-ety, 45 (9), 1077-1087.
  • Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T. 1999. A review of scheduling research involving setup consideration, OMEGA. (27), 219-239.
  • Bachman, A. and Janiak, A. 2004. Scheduling Jobs with Position-Dependent Processing Times, Journal of the Operational Research Society. (55), 257-264.
  • Bagchi, U., Sullivan, R. S. and Chang, Y.L. 1987a. Mini-mizing mean squared deviation of completion times about a common due date, Management Science. (33), 894-906.
  • Bagchi, U., Chang, Y.L. and Sullivan, R.S. 1987b. Mini-mizing absolute and squared deviations of com-pletion times with different earliness and tardi-ness penalties and a common due date, Naval Research Logistics. (34), 739-751.
  • Bagchi, U. 1987. Due date or deadline assignment to multi-job orders to minimize total penalty in the one machine scheduling problem, Presented at the ORSA/TIMS Joint National Conference, St. Louis, 210-218
  • Baker, K.R. and Scudder, G.D. 1990. Sequencing with earliness and tardiness penalties: A review, Op-erations Research. 38 (1), 22-36.
  • Baker, K.R. 1997. Elements of sequencing and schedul-ing, Dartmounth College, Hanover.
  • Bank, J. and Werner, F. 2001. Heuristics algorithms for unrelated parallel machine scheduling with a common due date, release dates and linear earli-ness tardiness penalties, Mathematical and Com-puter Modelling. (33), 363-383.
  • Bauman, J. and Jozefowska, J. 2006. Minimizing the earliness-tardiness costs on a single machine, Computers and Operations Research. (33), 3219-3230.
  • Biskup, D. 1999. Single-Machine Scheduling with Learning Considerations, European Journal of Op-erational Research. (115), 173-178.
  • Biskup, D. and Cheng, T.C.E. 1999. Multiple-Machine Scheduling with Earliness Tardiness And Comple-tion Time Penalties, Computer&Operations Re-search. 26 (1), 45-57.
  • Biskup, D. and Feldmann, M. 2001. Benchmarks for scheduling on single/machine against re-strictive and unrestrictive common due date,Computers&Operation Research. 28 (8), 787-801.
  • Biskup, D. and Simons, D. 2004. Common Due Date Scheduling with Autonomous and Induced Learning, European Journal of Operational Re-search. (159), 606-616.
  • Biskup, D. 2008. A State-of-the-Art Review on Sched-uling with Learning Effects, European Journal Of Operational Research. (188), 315-329.
  • Celso, M.H., Debora, P.R. and Andre, B.M. 2005. Mini-mizing Earliness And Tardiness Penalties in A Sin-gle-Machine Problem with A Common Due Date, European Journal of Operational Research. (160), 190-201.
  • Chang, S.S. and Joo, U.G. 1992. A single machine scheduling problem with earliness/tardiness and starting time penalties under a common due date, Computers&Operations Research. 19 (8), 753-766.
  • Chen, Z.L. 1997. Scheduling with batch setup times and earliness-tardiness penalties, European Jour-nal of Operational Research. (96), 518-537.
  • Chen, P., Wu, C.C. and Lee, W.C. 2006. A Bi-Criteria Two-Machine Flowshop Scheduling Problem with A Learning Effect, Journal of The Operational Re-search Society. (57), 1113-1125.
  • Cheng, T. 1988. Optimal common due date with limited completion time deviation, Computers&Operations Research. 15 (2), 91-96.
  • Cheng, T.C.E. 1989. A heuristic for common due date assignment and job scheduling on Parallel Ma-chines, Journal of Operational Research Society.(40), 1129-1135.
  • Cheng, T.C.E. and Chen, Z.L. 1994. Parallel machine scheduling problems with earliness and tardi-ness penalties, The Journal of the Operational Re-search Society. 45 (6), 685-695.
  • Cheng, T.C.E. and Wang, G. 2000. Single Machine Scheduling with Learning Effect Considerations, Annals Of Operations Research. (98), 273-290.
  • Cochran, E.B. 1960. New Concepts of The Learning Curve, The Journal of Industrial Engineering. (11), 317-327.
  • Coleman, B.J. 1992. A simple model for optimizing the single machine early/tardy problem with sequence-dependent setups, Production and Op-eration Management. (1), 225-228.
  • Conway R.W. and Schultz A. 1959. The Manufacturing Progress Function, The Journal of Industrial Engi-neering. (10), 39-54.
  • Day, G.S. and Montgomery, D.B. 1983. Diagnosing The Experience Curve, Journal of Marketing. (47), 44-58.
  • De, P., Ghosh, J.B. and Wells, C.E. 1989. A note on the minimization of mean squared deviation of com-pletion times about a common due date, Man-agement Science. (35), 1143-1147.
  • Du, J. and Leung, Y.T. 1990. Minimizing Total Tardiness on One Machine is NP-hard, Mathematics of Op-erations Research. (15), 483-495.
  • Eilon, S. and Chowdhury, I. 1977. Minimizing waiting time variance in the single machine problem, Management Science. (23), 567-575.
  • Emmons, H. 1987. Scheduling to a common due date on parallel uniform processors, Naval Research Logistics. (34), 803-810.
  • Eren, T. 2004. Çok Ölçütlü Akış Tipi Çizelgeleme Prob-lemleri İçin Çözüm Yaklaşımları, Doktora Tezi, Gazi Ünv. Ankara.
  • Eren, T. ve Güner, E. 2004. Öğrenme Etkili Akış Tipi Çizelgelemede Ortalama Akış Zamanının En Küçüklenmesi, Gazi Ünv. Müh. Mim. Fak. Dergisi.(19), 119-124.
  • Eren, T. and Guner, E. 2007. Minimizing Total Tardiness in A Scheduling Problem with A Learning Effect, Applied Mathematical Modelling. (31), 1351-1361.
  • Feldman, M. and Biskup, D. 2003. Single-Machine Scheduling For Minimizing Earliness And Tardi-ness Penalties by Meta-Heuristic Approaches, Computer And Industrial Engineering. (44), 307-323.
  • French, S. 1982. Sequencing and Scheduling: An Intro-duction to the Mathematics of the Job-Shop, Ellis Horwood Ltd., England.
  • Fry, T.D. 1987. Armstrong R.D. and Blackstone J.H., Min imizing weighted absolute deviation in single machine scheduling, IIE Transactions. (19), 445-450.
  • Garey, M.R., Tarjan, R.E. and Wilfong, G.T. 1988. One processor scheduling with symmetric earliness and tardiness penalties, Mathematics of Opera-tions Research. (13), 330-348.
  • Ghemawat, P. 1985. Building Strategy on The Experi-ence Curve-A Venerable Management Tool Re-mains Valuable - In The Right Circumstances, Harvard Business Review, 63 II, 143-149.
  • Gordon, V., Proth, J.M. and Chu, C. 2001. A survey of the state-of-the-art of common due date assign-ment and scheduling research, European Journal of Operational Research. (139), 1-25.
  • Gupta, S. and Sen, T. 1983. Minimizing a quadratic function of job lateness on a single machine, Engineering Costs Production Economics. (7), 181-194.
  • Hall, N.G. 1986. Single and multi-processor models for minimizing completion time variance, Naval Re-search Logistics Quarterly. (33), 49-54.
  • Hall, N.G. and Posner, M.E. 1991. Earliness-Tardiness Scheduling Problems, I: Weighted deviation of completion times about a common due date, Operation Research. (39), 836-846.
  • Hall, N.G., Kubiak, W. and Sethi, S.P. 1991. Earliness-tardiness scheduling problems, I: Weighted de-viation of completion times about a restrictive common due date, Operations Research. 39 (5), 847-856.
  • Heizer, J. and Render, B. 2001. Operations Manage-ment (6. Edition), Prentice Hall, New Jersey.
  • Hendel, Y. and Sourd, F. 2007. An improved earliness-tardiness timing algorithm, Computers and Op-erations Research. 34 (10), 2931-2938.
  • Hino, C.S., Ronconi, D.P. and Mendes, A.B. 2005. Mini-mizing earliness and tardiness penalties in a sin-gle-machine problem with a common due date, European Journal of Operational Research. (160), 190-201.
  • Kanet, J.J. 1981a. Minimizing variation of flow time in single machine systems, Management Science. (27), 1453-1459.
  • Kanet, J.J. 1981b. Minimizing the average deviation of job completion times about a common date, Naval Research Logistics Quarterly. (28), 643-651.
  • Kellegöz, T. 2006., Toplam Geç Bitirme Zamanının En Küçüklenmesi Performans Ölçütlü Permütasyon Akış Tipi Çizelgeleme Problemlerinin Çözümün-de Genetik Algoritma Yaklaşımı, Yüksek Lisans Tezi, Kırıkkale Üniv., Kırıkkale.
  • Keyser, T.K. and Sarper H. 1991. A heuristic solution of the E/G problem with waiting costs and non-zero release times, Computers & Industrial Engineering.(21), 297-301.
  • Koulamas, C. 1996. Single machine scheduling with time windows and earliness/tardiness penalties, European Journal of Operational Research. (91), 190-202.
  • Koulamas, C. and Kyparisis, G.J. 2007. Single-Machine And Two Machine Flowshop Scheduling with General Learning Function, European Journal of Operational Research. (178), 402-407.
  • Kuo, W.H. and Yang, D.L. 2006a. Minimizing The Total Completion Time in A Single-Machine Schedul-ing Problem with A Time-Dependent Learning Effect, European Journal of Operational Research. (174), 1184-1190.
  • Kuo, W.H. and Yang, D.L. 2006b. Single-Machine Group Scheduling with A Time-Dependent Learning Effect, Computers&Operations Research. 33 (8), 2099-2112.
  • Kuo, W.H. and Yang, D.L. 2006c. Minimizing The Makes-pan In A Single Machine Scheduling Problem with A Time-Based Learning Effect, Information Processing Letters. (97), 64-67.
  • Kuo, W.H. and Yang, D.L. 2007. Single machine sched-uling with past-sequence-dependent setup times and learning effects, Information Processing Letters. (102), 22-26.
  • Lapre ?, M.A. 2000. Mukkherjee A.S. and Van Wassen-hove L.N., Behind the Learning Curve: Linking Learning Activities to Waste Reduction, Manage-ment Science. (46), 597-611.
  • Lauff, V. and Werner, F. 2004. Scheduling with Com-mon Due Date, Earliness and Tardiness Penalties for Multimachine Problems: A Survey, Mathemat-ical and Computer Modelling. 40 (5-6), 637-655.
  • Lee, C.Y. 1991. Danusaputro S. L. And Lin C.S., Mini-mizing Weighted Number of Tardy Jobs And Weighted Earliness-Tardiness Penalties About A Common Due Date, Computers And Operations Research. (18), 379-389.
  • Lee, W.C., Wu, C.C. and Sung, H.J. 2004. A Bi-Criterion Single-Machine Scheduling Problem with Learn-ing Considerations, Acta Informatica. (40), 303-315.
  • Lee, W.C. and Wu, C.C. 2004. Minimizing Total Comple-tion Time in A Two-Machine Flowshop with A Learning Effect, International Journal of Produc-tion. (88), 85-93.
  • Leung, J.Y.T. 2002. A dual criteria sequencing problem with earliness and tardiness penalties, Naval Re-search Logistics. (49), 422-431.
  • Liao, C.J. and Cheng, C.C. 2007. A variable neighbor-hood search for minimizing single machine weighted earliness and tardiness with common due date, Computer&Industrial Engineering. (52), 404-413.
  • Liman, S.D. and Ramaswamy, S. 1994. Earliness-tardi-ness scheduling problems with a common de-livery window, Operations Research Letters. (15), 195-203.
  • Liman, S.D., Panwalkar, S.S. and Thongmee, S. 1996. Determination of common due window location in a single machine scheduling problem, Euro-pean Journal of Operational Research. (93), 68-74.
  • Lin, B.M.T. 2007. Complexity Results for Single-Ma-chine Scheduling with Positional Learning Ef-fects, Journal of The Operational Research Society.58 (8), 1099-1102.
  • Mondal, S.A. and Sen, A.K. 2001. Single Machine Weighted Earliness-Tardiness Penalty Problem with A Common Due Date, Computer And Opera-tions Research. (28), 649-669.
  • Mosheiov, G. 2001a. Scheduling problem with learn-ing effect, European Journal Of Operational Re-search. (132), 687-693.
  • Mosheiov, G. 2001b. Parallel machine scheduling with learning effect, Journal of The Operational Re-search Society. (52), 1165-1169.
  • Mosheiov, G. and Shadmon, M. 2001. Minmax earli-ness-tardiness costs with unit processing time jobs, European Journal of Operational Research.(130), 638-652.
  • Mosheiov, G. and Sidney, J.B. 2003. Scheduling with General Job-Dependent Learning Curves, Euro-pean Journal Of Operational Research. (147), 665-670.
  • Mosheiov, G. and Sidney, J.B. 2005. Note on Schedul-ing with General Learning Curves to Minimize Number of Tardy Jobs, Journal of The Operational Research Society, 56 (1), 110-112.
  • Öğe, M., 2001. Tam Zamanında (JIT) Sistemi ve Tekstil Sektöründe Bir Uygulama, Yüksek Lisans Tezi, Mar-mara Ünv., İstanbul.
  • Panwalkar, S.S., Smith, M.L. and Seidmann, A. 1982. Common due date assignment to minimize total penalty for the one machine scheduling prob-lem, Operations Research, 30, 391-399.
  • Panwalkar, S.S. and Liman, S.D. 2002. Single operation earliness-tardiness scheduling with machine ac-tivation cost, IIE Transactions, 34, 509-513.
  • Pinedo, M. 1995. Scheduling: Theory, Algoritms and Systems, Prentice Hall, NewJersey.
  • Pinedo, M. and Chao, X. 1999. Operation Scheduling with Applications in Manufacturing and Services, Mc Graw Hill, NewYork.
  • Rym, M. 2007. Minimizing Total Earliness And Tardi-ness on A Single machine using a hybrid heuris-tic, Computer&Operations Research. 34 (10), 3126-3142.
  • Sakuraba, C.S., Ronconi, D.P. and Sourd, F. 2009. Sched-uling in a two-machine flowshop for the mini-mization of the mean absolute deviation from a common due date, Computers&Operations Re-search. 36 (1), 60-72.
  • Sarper, H. 1995. Minimizing the sum of absolute devia-tions about a common due date for the two-ma-chine flow shop problem, Applied Mathematical Modelling. 19 (3), 153-161.
  • Schaller, J.E. and Gupta, J.N.D. 2008. Single machine scheduling with family setups to minimize total earliness and tardiness, European Journal of Op-eration Research. (187), 1050-1068.
  • Seidmann, A., Panwalkar, S.S. and Smith, M.L. 1981. Optimal assignment of due-dates for a single processor scheduling problem, International Journal of Production Research, 19 (4), 393-399.
  • Shabtay, D. 2008. Due date assignments and sched-uling a single machine with a general earliness/tardiness cost function, Computers&Operation Re-search. 35 (5), 1539-1545.
  • Soroush, S.M. and Fredendall, L.D. 1994. The stochas-tic single machine scheduling problem with ear-liness-tardiness costs, European Journal of Opera-tional Research. (77), 287-302.
  • Sun H. and Wang, G. 2003. Parallel machine earli-ness and tardiness scheduling with proportional weights, Computers and Operations Research.(30), 801-808.
  • Sundararaghavan, P.S. and Ahmed, M.U. 1984. Mini-mizing the sum of absolute lateness in single machine and multimachine scheduling",Naval Research Logistics Quarterly. (31), 325-333.
  • Sundararaghavan, P.S. and Kunnathur, A.S. 1994. Single machine scheduling with start time de-pendent processing time: Some solvable cases, European Journal of Operational Research. 78 (3), 394-403.
  • Szwarc W. and Mukhopadhyay S.K. 1995. Optimal tim-ing schedules in earliness-tardiness single-ma-chine sequencing, Naval Research Logistics. (42), 1109-1114.
  • Toksarı, M.D. and Güner, E. 2008. Parallel machine ear-liness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration, Computers&Operations Research, Accepted Manuscript.
  • Valente, J.M.S. and Alves, R.A.F.S. 2005. Filtered and re-covering beam search algorithms for early/tardy scheduling problem with no idle time, Computers and Industrial Engineering. (48), 363-375.
  • Vani, V. and Raghavachari, M. 1987. Deterministic and random single machine scheduling with variance minimization, Operations Research. (35), 111-120.
  • Venezia, I. 1985. On The Statistical Origins of The Learning Curve, European Journal of Operational Research. (19), 191-200.
  • Ventura J.S., Kim D. and Garriga F. 2005. Single machi-ne earliness-tardiness scheduling with resource-dependent release dates, European Journal of Operational Research. (142), 52-69.
  • Wang, J.B. and Xia, Z.Q. 2005. Flow-shop Scheduling with A Learning Effect, Journal of the Operational Research Society. (56), 1325-1330.
  • Wang, J.B. 2006. A Note on Scheduling Problems with Learning Effects and Deteriorating Jobs, Interna-tional Journal of Systems Science. (37), 827-833.
  • Wang, X. and Cheng, T.C.E. 2007. Single-machine sche-duling with deteriorating jobs and learning ef-fects to minimize the makespan, European Jour-nal of Operational Research. (178), 57-70.
  • Wang, J.B. 2007., Single-Machine Scheduling Prob-lems with The Effects of Learning and Deteriorati-on. Omega. (35), 397-402.
  • Wright T.P. 1936. Factors Affecting the Cost of Airpla-nes, Journal of the Aeronautical Sciences. (3), 122-128.
  • Yano, C. A. and Kim, Y. D. 1991. Algorithms for a class of single-machine weighted tardiness and earli-ness problems, European Journal of Operational Research, 52, 167-178. Yelle, L.E. 1979. The Lear-ning Curve: Historical Review and Comprehensi-ve Survey, Decision Science. (10), 302-328.
  • Zhao, C.L., Zhang, Q.L. and Tang, H.Y. 2004. Machi-ne Scheduling Problems with Learning Effects,Dynamics of Continuous, Discrete and Impulsive Systems, Series A: Mathematical Analysis. (11), 741-750.
  • Zhu, Z. and Heady, R.B. 2000. Minimizing the sum of earliness/tardiness in multi-machine schedu-ling: a mixed integer programming approach, Computers&Industrial Engineering. (38), 297-305
APA İŞLER M, Toklu B, ÇELİK V (2009). Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. , 227 - 252.
Chicago İŞLER Mesut Cemil,Toklu Bilal,ÇELİK Veli Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. (2009): 227 - 252.
MLA İŞLER Mesut Cemil,Toklu Bilal,ÇELİK Veli Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. , 2009, ss.227 - 252.
AMA İŞLER M,Toklu B,ÇELİK V Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. . 2009; 227 - 252.
Vancouver İŞLER M,Toklu B,ÇELİK V Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. . 2009; 227 - 252.
IEEE İŞLER M,Toklu B,ÇELİK V "Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması." , ss.227 - 252, 2009.
ISNAD İŞLER, Mesut Cemil vd. "Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması". (2009), 227-252.
APA İŞLER M, Toklu B, ÇELİK V (2009). Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. Mühendislik Bilimleri Dergisi, 15(2), 227 - 252.
Chicago İŞLER Mesut Cemil,Toklu Bilal,ÇELİK Veli Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. Mühendislik Bilimleri Dergisi 15, no.2 (2009): 227 - 252.
MLA İŞLER Mesut Cemil,Toklu Bilal,ÇELİK Veli Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. Mühendislik Bilimleri Dergisi, vol.15, no.2, 2009, ss.227 - 252.
AMA İŞLER M,Toklu B,ÇELİK V Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. Mühendislik Bilimleri Dergisi. 2009; 15(2): 227 - 252.
Vancouver İŞLER M,Toklu B,ÇELİK V Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması. Mühendislik Bilimleri Dergisi. 2009; 15(2): 227 - 252.
IEEE İŞLER M,Toklu B,ÇELİK V "Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması." Mühendislik Bilimleri Dergisi, 15, ss.227 - 252, 2009.
ISNAD İŞLER, Mesut Cemil vd. "Öğrenme Etkili Erken/Geç Tamamlanma Çizelgeleme Problemleri İçin bir Literatür Araştırması". Mühendislik Bilimleri Dergisi 15/2 (2009), 227-252.
Sayfa Oluşturulma Tarihi
23-04-2024 1:6

İLETİŞİM

TÜBİTAK ULAKBİM TR Dizin

Yüzüncüyıl, İşçi Blokları Mahallesi

Muhsin Yazıcıoğlu Caddesi No:51/C

06530 Çankaya / ANKARA +90 (312) 298 92 00

trdizin@tubitak.gov.tr

TÜBİTAK ULAKBİM Ulusal Akademik Ağ ve Bilgi Merkezi Cahit Arf Bilgi Merkezi © Tüm Hakları Saklıdır. Gizlilik Politikası Kullanım Şartları