Buradasınız

Anasayfa » Content

İKİ ÖLÇÜTLÜ ZAMANA-BAĞIMLI ÖĞRENME ETKİLİ ÇİZELGELEME PROBLEMİ

A BICRITERIA SCHEDULING PROBLEM WITH A TIME-DEPENDENT LEARNING EFFECT

Journal Name:

  • Süleyman Demirel Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi

Publication Year:

  • 2009
Author NameUniversity of Author
Abstract (2. Language): 
In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is known as the ''learning effect". In this study, we introduce a time-dependent learning effect into a bicriteria single-machine scheduling problem. The objective function of the problem is minimization of the maximum earliness and number of tardy. A non-linear programming model is developed for the problem which belongs to NP-hard class. Also the model is tested on an example.
Bookmark/Search this post with
Abstract (Original Language): 
Çizelgeleme literatürünün çoğunda işlerin işlem zamanları sabit kabul edilmiştir. Ancak işlerin işlem zamanlarında, başlama zamanı veya pozisyonuna bağlı olarak azalma görülebilmekterdir. Bu olgu literatürde öğrenme ekisi olarak bilinmektedir. Bu çalışmada da iki ölçütlü zamana-bağımlı öğrenme etkili tek makineli çizelgeleme problemi ele alınacaktır. Ele alınan problemin amaç fonksiyonu ise maksimum erken bitrme geciken iş sayısını enküçüklemektir. NP-zor yapıda olan problemi çözmek için doğrusal-olmayan programlama modeli geliştirilmiştir. Geliştirilen model bir örnek üzerinde uygulanmıştır.
FULL TEXT (PDF): 
PDF icon arastirmax-iki-olcutlu-zamana-bagimli-ogrenme-etkili-cizelgeleme-problemi.pdf
  • 1
387-394
  • Turkish

REFERENCES

References: 

1. AZİZOĞLU M., KONDAKÇI S., KÖKSALAN M., "Single machine scheduling with maximum earliness and number tardy", Computers & Industrial Engineering, 45, 2003, 257-268.
2. BISKUP D. Single-machine scheduling with learning considerations, European Journal of Operational Research, 115, 173-178, 1999.
3. BISKUP D., A state-of-the-art review on scheduling with learning effects, European Journal of Operational Research, in print, 2008.
4. Cheng T.C.E., Wang G. "Single machine scheduling with learning effect considerations", Annals of Operation Research, 98, 2000, 273-290.
5. DU J., LEUNG J.Y.T., Minimizing total tardiness on one machine is NP-hard, Mathematics of Operations Research, 15, 1990, 483—195.
6. EREN T., GÜNER E., Minimizing total tardiness in a scheduling problem with a learning effect, Applied Mathematical Modelling, 31,
2007, 1351-1361.
7. GÜNER E., EROL S., TANI K., "One Machine Scheduling to Minimize
The Maximum Earliness with Minimum Number of Tardy Jobs", International Journal of Production Economics, 55, 1998, 213-219.
393
EREN
3009
8. KUO, W.-H., YANG, D.-L., Minimizing the total completion time in a singlemachine scheduling problem with a time-dependent learning effect, European Journal of Operational Research, 174, 2006a, 1184¬1190.
9. KUO, W.-H., YANG, D.-L., Minimizing the makespan in a single machine scheduling problem with a time-based learning effect, Information Processing Letters, 97, 2006b, 64-67.
10. KUO, W.-H., YANG, D.-L., Single-machine group scheduling with a timedependent learning effect, Computers and Operations Research,
33, 2006c, 2099-2112.
11. MOORE, J.M., An n job, one machine sequencing algorithm for minimizing the number of tardy jobs, Management Science, 15, 1968,
102-109.
12. MOSHEIOV, G., Scheduling problems with a learning effect, European Journal of Operational Research, 132, 2001, 687-693.
13. MOSHEIOV G., SIDNEY, J.B., "Note on scheduling with general
learning curves to minimize the number of tardy jobs", Journal of the Operational Research Society, 56, 2005, 110-112.
14. WU, C.-C., LEE, W.-C., CHEN, T., Heuristic algorithms for solving the
maximum lateness scheduling problem with learning considerations, Computers & Industrial Engineering, 52, 2007, 124-132.
15. ZHAO, C.-L., ZHANG Q.-L., TANG, H.-Y., Machine scheduling problems with learning effects, Dynamics of Continuous, Discrete and Impulsive Systems, Series A: Mathematical Analysis, 11, 2004, 741¬750.

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