FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ

  • Tamer Eren
Keywords: Parallel Machine Scheduling Problem, Learning Effect, Release Date, Makespan, Integer Programming, Heuristic Methods

Abstract

In this study m-identical parallel machine scheduling problem with release date is considered. The objective
function of the problem is minimization of the makespan. An integer programming model is developed for the
problem which belongs to NP-hard class. To improve the performance of tabu search algorithm the best result of
the dispatching rules is taken as an initial solution of tabu search algorithm. According to computational results
the tabu search algorithm is effective in finding problem solutions with up to 500 jobs.

References

[1] Mosheiov, G., “Parallel machine scheduling
with learning effect”, Journal of the Operational
Research Society, Volume 52, pp. 1165-1169, 2001.
[2] Mosheiov, G., Sidney, J.B., “Scheduling with
General Job-Dependent Learning Curves”,European
Journal of Operational Research, Volume 147, pp.
665-670, 2003.
[3] Eren, T., Güner, E., “Öğrenme etkisinin iki
ölçütlü paralel makinalı çizelgeleme problemlerinde
uygulanması”, YA/EM’2004, XXIV. Ulusal Kongresi,
s. 473-475, Gaziantep – Adana. 15-18 Haziran 2004.
[4] Eren, T., Güner, E., “Öğrenme etkili iki ölçütlü
paralel makineli çizelgeleme problemlerinin çözümü
için tamsayılı programlama modeli”, 4. İstatistik
Kongresi, s. 92-93, Antalya, 12-15 Mayıs, 2005.
[5] Eren, T., Güner, E., “A Bicriteria parallel
machine scheduling problem with a learning effect:
total completion times and maximum tardiness”, 9th
International Research/Expert Conference on "Trends
in the development of Machinery and associated
Technology", pp. 1525-1528, September 26-30, 2005,
Antalya, Turkey.
[6] Eren T., Güner E., “A bicriteria parallel
machine scheduling with a learning effect”, The
International Journal of Advanced Manufacturing
Technology, in print.
[7] Eren T., “A bicriteria parallel machine
scheduling with a learning effect of setup and removal
times” Applied Mathematical Modelling, in print.
[8] Lenstra, J.K., Kan Rinnooy, A.H.G., Brucker,
P., “Complexity of machine scheduling problems”,
Annals of Discrete Mathematics, Volume 4, pp. 281-
300, 1977.
[9] Fox, R.L., “Optimization methods for
engineering design”, Addision Wesley Publishing
Company, London, 1971.
[10] Jang, J.–S.R., Sun, C.T., Mizutani, E., “Neurofuzzy
and soft computing: A computational approach
to learning and machine intelligence”, Prentice Hall,
USA, 1997.
[11] Glover, F., “Future paths for integer
programming and links to artificial intelligence”,
Computers and Operations Research, Volume 5, pp.
533-549, 1986.
Published
2008-07-21
How to Cite
[1]
T. Eren, “FARKLI GELİŞ ZAMANLI ÖĞRENME ETKİLİ PARALEL MAKİNELİ ÇİZELGELEME PROBLEMİ”, JAST, vol. 3, no. 4, pp. 37-46, Jul. 2008.
Section
Articles