Abstract
Bu calismada tek makineli cizelgelemede ogrenme etkisi analiz edilmis, performans olcutu olarak da toplam tamamlanma zamani ve maksimum gecikme alinmistir. Calismada problemin klasik (ogrenme etkisiz) durumda en iyi cozumu garanti eden Smith Algoritmasi [1] (maksimum gecikmeyi minimize etme kisiti altinda toplam tamamlanma zamanini minimize etme) ve Van Vassenhove ve Gelder algoritmasinin [2] (toplam tamamlanma zamani ve maksimum gecikmeyi ayni anda minimize etme) ogrenme etkili durumda optimal cozumu garanti etmedigi gosterilmistir. Problemleri cozmek icin matematiksel programlama modelleri gelistirilmistir.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Uluslararası Muhendislik Arastirma ve Gelistirme Dergisi
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
