SavedAdd your journal

Journals / Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi / 2009 / Cilt: 15 - Sayı: 2

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

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

Mesut Cemil İŞLER
Bilal TOKLU
Vel ÇELİK
Pages
227–252
Publication Date
2009-02-01
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

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.

📌 3 Key Takeaways

🎯
Objective & Hypothesis: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.
📊
Key Findings & Data:Wright determined how workmanship costs decreased while proceed plain increasing.
💡
Conclusion & Impact: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.
🔬Design:Survey & Empirical Study
📍Scope:Comprehensive Sample
⚙️Variables:Çizelgeleme · E/G tamamlanma · Öğrenme etkisi

Abstract

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.

Özet

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.

🔖

Cite This Article

İŞLER, M. C., TOKLU, B., ÇELİK, V. (2009). A Literature Survey for Earliness/Tardiness Scheduling Problems with Learning Effect. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, Cilt: 15 - Sayı: 2, 227–252. https://ajindex.com/articles/42907

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (15)

  1. Abdul-Razaq, T. and Potts, C. 1988. Dynamic programming state-space relaxation for single-machine scheduling, Journal of Operational Research Society. (39), 141-152.
  2. Acar, N. 2002.
  3. Tam Zamanında Üretim, MPM Yayınları No: 542. Ankara.
  4. Adamopoulos, G.I. and Pappis, C.S. 1998. Scheduling under a common due date on parallel unrelated machines, European Journal of Operational Research. (105), 495-501.
  5. Alidaee, B., Kochenberger, G.A. and Ahmadian, A. 1994. Minimization total absolute flow time deviation in single and multiple machine scheduling, The Journal of the Operational Research Society, 45 (9), 1077-1087.
  6. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T. 1999. A review of scheduling research involving setup consideration, OMEGA. (27), 219-239.
  7. Bachman, A. and Janiak, A. 2004. Scheduling Jobs with Position-Dependent Processing Times, Journal of the Operational Research Society. (55), 257-264.
  8. Bagchi, U., Sullivan, R. S. and Chang, Y.L. 1987a. Minimizing mean squared deviation of completion times about a common due date, Management Science. (33), 894-906.
  9. Bagchi, U., Chang, Y.L. and Sullivan, R.S. 1987b. Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date, Naval Research Logistics. (34), 739-751.
  10. 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.
  11. Baker, K.R. and Scudder, G.D. 1990. Sequencing with earliness and tardiness penalties: A review, Operations Research. 38 (1), 22-36.
  12. Baker, K.R. 1997. Elements of sequencing and scheduling, 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 earliness tardiness penalties, Mathematical and Computer Modelling. (33), 363-383.
  13. Bauman, J. and Jozefowska, J. 2006. Minimizing the earliness-tardiness costs on a single machine, Computers and Operations Research. (33), 32193230. Biskup, D. 1999. Single-Machine Scheduling with Learning Considerations, European Journal of Operational Research. (115), 173-178.
  14. Biskup, D. and Cheng, T.C.E. 1999. Multiple-Machine Scheduling with Earliness Tardiness And Completion Time Penalties, Computer&Operations Research. 26 (1), 45-57.
  15. Biskup, D. and Feldmann, M. 2001. Benchmarks for scheduling on single/machine against restrictive and unres