Buradasınız

MALİYET TABANLI ÇİZELGELEME VE BİR MOBİLYA FABRİKASINDA UYGULAMASI

COST-BASED SCHEDULING AND AN APPLICATION IN A FURNITURE FACTORY

Journal Name:

Publication Year:

Keywords (Original Language):

Author NameUniversity of AuthorFaculty of Author
Abstract (2. Language): 
As a general, operation duration is taken into consideration to be able to solve the scheduling problems. In addition, holding cost is being fixed at each job. In fact, holding cost in parts used for each job is different. In this study, by using the data for one week taken from panel cutting machine in a furniture factory, it is compared generally used scheduling dispatching rules for one machine and made a cost-based scheduling. Thus, decision making criteria have been evaluated from the point of a manager. It is developed a computer program by Delphi programming language for this aim. As a result, It is noticed that cost-based scheduling is more better than time-based scheduling.
Abstract (Original Language): 
Genellikle, çizelgeleme problemlerinin çözümü, işlem süreleri dikkate alınarak yapılmakla beraber elde bulundurma maliyeti her bir iş için sabit tutulmaktadır. Gerçekte ise her bir iş için kullanılan parçaların elde bulundurma maliyetleri farklıdır. Bu çalışmada, bir mobilya fabrikasında bulunan panel kesme makinesinden toplanan 1 haftalık verilerle, tek makina için çizelgeleme kurallarının kullanımı ve karşılaştırması yapılarak her bir iş için elde bulundurma maliyetlerinin hesaplanmasıyla maliyet tabanlı çizelgeleme yapılmış ve bir yönetici için maliyetlerin önemli olduğu bir noktada karar verme kriterleri değerlendirilmiştir. Karşılaştırmaları yapabilmek için Delphi programlama dili ile amaca yönelik bir program geliştirilmiştir. Yapılan çalışma sonucunda, maliyet boyutlu çizelgelemenin daha avantajlı olduğu görülmektedir.
107-116

REFERENCES

References: 

[1] Burkan S., “A Genetic Algorithm Approach to Job-Shop Scheduling”, Ph.D, Industrial
Engineering, Cleveland State University, 1999.
[2] Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling:
algorithms and complexity. Ch. 9 In: Graves SC, Rinnooy Kan AHG, Zipkin PH, editors.
Handbooks in operations research and management science, vol. 4, Logistics of
production and inventory. Amsterdam:North-Holland, p. 445-522, 1993.
[3] Feldman, M., Biskup D., “Single Machine Scheduling for Minimizing Earliness and
Tardiness Penalties by Meta Heuristic Approaches”, Computers & Industrial Engineering,
44, 2, 307-323, 2003.
[4] Dileepan, P., and Sen, T., “Bicriterion Static Scheduling Research For A Single
Machine”, Omega International Journal of Management Science, Volume 16, No:1, 53-
59, 1988.
[5] Gupta, S., and Kyparisis, J., “Single-Machine Scheduling Research”, Omega International
Journal of Management Science, Volume 15, No:3, 207-227, 1987.
[6] Baker, K.R., Elements of Sequencing and Scheduling, Dartmouth College, hanover, 1997.
[7] Morton, T.E., Pentico, D. W., Heuristic Scheduling Systems, Wiley, New York, 1993.
[8] Pinedo, M.L., Scheduling:Theory, Algorithms, and Systems, Prentice-Hall, Englewood,
1995.
[9] Jayamohan M.S., Rajendran C., “Development and Analysis of Cost-based Dispatching
Rules for Job Shop Scheduling”, European Journal of Operational Research, 157, 307–
321, 2004.
[10] Blackstone, J.H., Phillips, D.T., Hogg, G.L., “A State of Art Survey of Dispatching Rules
for Manufacturing Job Shop Operations”, International Journal of Production Research,
20, 27-45, 1982.
[11] French, S., “Sequencing and Scheduling, an Introduction to the Mathematics of the Job
Shop”, ellis horwood, chichester, 1982.
[12] Haupt, R., “A Survey of Priority Rule Based Dispatching”, O.R. Spektrum, 11, 3-16,
1989.
[13] Jensen, J.B., Philipoom, P.R., Malhotra, M.K., “Technical Note: Evaluation of Scheduling
Rules with Commensurate Customer Priorities in Job Shops”, Journal of Operations
Management, 13, 213-228, 1995.
[14] Pinedo M.L, Chao X., “Operations Scheduling with Applications in Manufacturing and
Services”, McGraw-Hill, 1999.
[15] Nahmias S., “Production and Operations Analysis”, 4th Edition, McGrawHill, 2001.
[16] Vepsalainen, A.P.J., Morton, T.E., “Priority Rules for Job Shops with Weighted Tardiness
Costs.Management Science”, 33, 1035-1047, 1987.

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