Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması

Tamer EREN, (Kırıkkale Üniversitesi, Mühendislik Fakültesi, Endüstri Mühendisliği Bölümü, Kırıkkale, Türkiye)
Ertan GÜNER (Girilmedi)
Mühendislik Bilimleri Dergisi
5 0
Yıl: 2004 Cilt: 10 Sayı: 1 Sayfa Aralığı: 19 - 30 Metin Dili: Türkçe İndeks Tarihi: 29-07-2022

Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması

Öz:
Çizelgeleme, imalat ve servis endüstrilerinde çok önemli role sahip bir karar verme prosesidir. Bir firmada çizelgeleme fonksiyonu, matematiksel teknikler veya sezgisel yöntemler kullanarak sınırlı kaynakların görevlere tahsis edilmesi işlemini gerçekleştirir. Çizelgeleme literatüründe birden fazla ölçütün bulunduğu çizelgeleme çalışmaları son yıllarda gittikçe artmıştır. Ancak bu tür problemlerin çözümü tek ölçütlü problemler kadar kolay değildir. Çünkü birbirleri ile çelişen amaçların aynı anda eniyilendiği tek bir çizelgeyi oluşturmak oldukça zordur ve bu konudaki literatür tek ölçütlülere göre daha azdır. Son zamanlarda tek makinalı sistemlerin yanı sıra akış tipi çizelgeleme problemlerinde de çok ölçütlü çalışmalar ilgi çekmektedir. Bu çalışmada, çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması yapılmıştır.
Anahtar Kelime:

A literature survey for multicriteria flowshop scheduling problems

Öz:
Scheduling is a decision making process in manufacturing and service industry which has an important role. Scheduling function in a firm assigns restricted resources to the tasks using mathematical and heuristic techniques. In scheduling literature multicriteria scheduling problems are faced in an increasing manner in recent years. However, the solution of this kind of problems is not as easy as the single criterion problems. Since the objectives are in conflict with each other, it is very difficult to optimize the objectives simultaneously. The area is less then the literature in single criterion scheduling. Recently, the studies on the multicriteria flowshop scheduling have received attention. This study considers a literature survey for multicriteria flowshop scheduling problems.
Anahtar Kelime:

Belge Türü: Makale Makale Türü: Araştırma Makalesi Erişim Türü: Erişime Açık
  • Aarts, E. H. L., Korst, J. H. 1989a. Simulated Annealing and Bolzmann Machines: A Stochastic Approach to Combinatorial optimization and Neural Computing, Wiley, New York.
  • Aarts, E. H. L., Korst, J. H. 1989b. Boltzmann Machiness for Traveling Salesman Problems, European Journal of Operational Research, Volume 39, No. 1, pp. 79-95.
  • Allahverdi, A. 2001. The Tricriteria Two-Machine Flowshop Scheduling Problems, International Transactions Operational Research, Vol. 8, pp. 403-425.
  • Allahverdi, A. 2002. The Two- and m-Machine Flowshop Scheduling Problems with Bicriteria of Makespan and Mean Flowtime, European Journal of Operational Research (in Press).
  • Allahverdi, A., Mittenthal, J. 1998. Dual Criteria Scheduling on a Two-machine Flowshop Subject to Random Breakdowns, International Transactions in Operational Research, Volume 5, No: 4, pp. 317-324.
  • Allahverdi, A., Aldowaisan, T. 2002. No-wait Flowshop with Bicriteria of Makespan and Total Completion Time, Journal of Operational Research Society, Volume 53, pp. 1004-1015.
  • Baker, K. R. 1974. Introduction to Sequencing and Scheduling, John Wiley and Sons, New York. Campbell, H. G., Dudek, R. A., Smith, M. L. 1970. A Heuristic Algorithm for The n-Job, m-Machine Sequencing Problem, Management Science, Volume 16, pp. 630-637.
  • Chakravarthy, K., Rajendran, C. 1999. A Heuristic for Scheduling in a Flowshop with the Bicriteria of Makespan and Maximum Tardiness Minimization, Production Planning and Control, Volume 10, No: 7, pp. 707-714, 1999.
  • Chang, P. C., Hsieh, J.-C., Lin, S.-G. 2002. The Development of Gradual Priority Weighing Approach for The Multi-Objective Flowshop Scheduling Problem, International Journal of Production Economics (in press).
  • Chen, C. L., Bulfin, R.L. 1990. Scheduling Unit Processing Time Jobs on A Single Machine with Multiple Criteria, Computers and Operations Research, Volume 17, No: 1, pp. 1-7.
  • Chen, C. L., Bulfin, R. L. 1993. Complexity of Single Machine Multi-criteria Scheduling Problems, European Journal of Operational Research, Volume 70, pp. 115-125.
  • Chen, C., Neppalli, V., Aljaber, N. 1996. Genetic Algorithms Applied to The Continuous Flowshop Problem, Computers and Industrial Engineering, Volume 30, pp. 919-929.
  • Cherny, V. 1985. Thermodynamical Approach to Traveling Salesman Problem: an Efficient Simulation Algorithm, Journal of Optimization Theory and Applications, Volume 45 No: 1, pp. 41-51.
  • Chou, F. D., Lee, C. E. 1999. Two-Machine Flowshop Scheduling with Bicriteria Problem, Computers and Industrial Engineering, Volume 36, pp. 549-564.
  • Daniels, R. L., Chambers, R. J. 1990. Multiobjective flow-Shop Scheduling, Naval Research Logistics, Volume 37, pp. 981-995.
  • De Jong, K. A. 1975. An Analysis of the Bahavior of a Class of Genetic Adaptive Systems, Ph.D. Thesis, University of Michigan.
  • Dileepan, P., Sen, T. 1988. Bicriterion Static Scheduling Research For A Single Machine, OMEGA International Journal of Management Science, Volume 16, No: 1, pp. 53-59.
  • Dorigo, M., Maniezzo V., Colorni A. 1996. Ant System: Optimization by A Colony of Cooperating Agents. IEEE Transactions on Systems, Man and Cybernitics, Volume 26, No: 1, pp. 29-41.
  • Dorigo, M., Di Caro, G., Gambardella, L. M. 1999. Ant Algorithms for Discrete Optimization, Artificial Life, Volume 5, No: 2, pp. 137-172.
  • Dueck, G., Scheuer, T. 1990. Thereshold Accepting: A General Purpose Optimization Algorithm Apperaing Superior to Simulated Annealing, Journal of Compitational Physics, Volume 90, pp. 161-175.
  • Eastman, W. L. 1959. A Solution to the Travelling-Salesman Problem, Econometrica, Volume 27, pp. 282.
  • Eren, T., ve Güner, E. 2002. Tek ve Paralel Makinada Çok Ölçütlü Çizelgeleme Problemleri için Bir Literatür Taraması", Gazi Üniversitesi Mühendislik - Mimarlık Fakültesi Dergisi, Cilt 17, No: 4, s. 37-70.
  • Framinan, J. M., Leisten, R., Ruiz-Usano, R. 2002. Efficient Heuristics for Flowshop Sequencing with The Objectives of Makespan and Flowtime Minimisation, European Journal of Operational Research, Volume 141, pp. 559-569.
  • Fry, T. D., Armstrong, R. D., Lewis, H. 1989. A Framework for Single Machine Multiple Objective Sequencing Research, OMEGA, Volume 17, No: 6, pp. 595-607.
  • Gangadharan, R., Rajendran, C. 1993. Heuristic Algorithms for Scheduling in The No-wait Flowshop, International Journal of Production Economics, Volume 32, pp. 285-290.
  • Gangadharan, R., Rajendran, C. 1994. A Simulated Annealing Heuristic for Scheduling in a Flowshop with Bicriteria, Computers and Industrial Engineering, Volume 27, No: 1-4, pp. 473-476.
  • Garey, M. R., Johnson, D. S., Sethi, R. 1976. The Complexity of Flowshop and Jobshop Scheduling, Mathematics of Operations Research, Volume 1, No: 2, pp. 117-129.
  • Gelders, F. L., Sambandam, N. 1978. Four Simple Heuristic for Scheduling a Flowshop, International Journal of Production Research, Volume 16, pp. 221-231.
  • Glover, F. 1989. Tabu Search - Part I, ORSA Journal on Computing, Volume 1, No: 3, pp. 190-206.
  • Glover, F. 1990. Tabu Search - Part IT, ORSA Journal on Computing, Volume 2, No: 1, pp .4-32.
  • Glover, F., and Laguna, M., 1997, Tabu Search, Kluwer Academic Publishers, United Stated of America.
  • Goldberg, D. E. 1989. Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading, M. A.
  • Gupta, J. N. D. 1972. Heuristic Algorithm for Multistage Flowshop Scheduling Problem, AIIE Transactions, Volume 3, pp. 11-18.
  • Gupta, J. N. D., Hennig, K., Werner, F. 2002. Local Search Heuristic for Two-stage Flow Shop Problems with Secondary Criterion, Computers and Operations Research, Volume 29, pp. 123-149.
  • Gupta, S., Kyparisis, J. 1987. Single Machine Scheduling Research, OMEGA International Journal of Management Science, Volume 15, No: 3, pp. 207-227
  • Gupta, J. N. D., Palanimuthu N., Chen C. - L. 1999. Designing and Tabu Search Algorithm for the Two-Stage Flow Shop Problem with Secondary Criterion", Production Planning and Control, Volume 10, No: 3, pp. 251-265.
  • Gupta, J. N. D., Neppalli V. R., and Werner, F. 2001. Minimizing Total Flow Time in A Two-Machine Flowshop Problem with Minimum Makespan, International Journal of Production Economics, Volume 69, pp. 323-338
  • Held, M., and Karp, R. M. 1962. A Dynamic Programming Approach to Sequencing Problems, SIAM Journal on Applied Mathematics, Volume 10, No: 1, pp. 196-210.
  • Ho, J. C. 1995. Flowshop Sequencing with Mean Flowtime Objective, European Journal of Operational Research, Volume 81, pp. 571-578.
  • Ho, J. C, Chang, Y. L. 1991. A New Heuristic for The n-Job, m-Machine Flowshop Problem, European Journal of Operational Research, Volume 52, pp. 194-202.
  • Holland, J. H. 1975. Adaptation in Natural and Artificial systems. University of Michigan Press. Ignall, E., and Schrage, L. E. 1965. Application of The Branch-and-Bound Technique to Some Flowshop Problems", Operations Research, Volume 13, pp. 400-412.
  • Ishibuchi, H., Murata, T. 1998. A Multi-Objective Gnetic Local Search Algorithm and Its Application to Flowshop Scheduling, IEEE Transactions on Systems, Man, and Cybernetics-Part-C: Applications and Review, Volume 28, No: 3, pp. 392-403.
  • Johnson, S. M. 1954. Optimal Two-and Three-Stage Production Schedules with Setup Times Included, Naval Research Logistic Quarterly, Volume 1, pp. 61-68.
  • Kan, A. H. G. 1976. Machine Scheduling Problems, Martinus Nijhoff, The Hague.
  • Kirkpatrick, S., Gelatt, C. D., Vecchi, M. P. 1983. Optimization by Simulated Annealing, Science, Volume 220, pp. 671-680.
  • Klein, D., Hannan, E. 1982. An Algorithm for The Multiple Objective Integer Linear Programming Problem, European Journal of Operational Research, Volume 9, No: 19, pp. 378-385.
  • Lawler, E. L. 1964. On Scheduling Problems with Deferral Costs, Managemet Science, Volume 11, pp. 280-288.
  • Lawler, L. E., Moore, J. M. 1969. Functional Equation and Its Application to Resource Allocation and Sequencing Problems, Management Science, Volume 16, pp. 77-84.
  • Lee, C. - E., Chou, F. D. 1998. A Two-machine Flowshop Scheduling Heuristic with Bicriteria Objective, International Journal of Industrial Engineering, Volume 5, No:2, pp. 128-139.
  • Lee, W. - C., Wu, C. C. 2001. Minimizing The Total Flow Time and the tardiness in a Two-Machine Flow Shop, International Journal of Systems Science, Volume 32, No: 3, pp. 365-373.
  • Lee, H. T., Chen, Sç. H., Kang, H. Y. 2002, Multicriteria Scheduling Using Fuzzy Theory and Tabu Search, International journal of Production Research, Volume 40, No: 5, pp. 1221-1234.
  • Lenstra, J. K. 1985. Sequencing by Enumerative Method, Second Printing, Mathemtisch Centrum.
  • Liao, C. J., Yu, W. C., Joe, C. B. 1997. Bicriterion Scheduling in The Two-machine Flowshop, Journal of Operational Research Society, Volume 48, pp. 929-935.
  • Morton, T. E., Pentico, D. W. 1993. Heuristic Scheduling Systems, Wiley, New York.
  • Miyazaki, S., Nishiyama, 1980. Analysis for Minimizing Weighted Mean Flow-Time in Flow-Shop Scheduling, Journal of Operational Research Society of Japan, Volume 23, pp. 118-132.
  • Murata, T., Ishibuchi, H., Tanaka, H. 1996. Multi-Objective Genetic Algorithm and Its Applications to Flowshop Scheduling, Computers and Industrial Engineering, Volume 30, No: 4, pp. 957-968.
  • Nagar, A., Hadddock, J., Heragu, S. 1995a. Multiple and Bicriteria Scheduling: A Literature Survey, European Journal of Operational Research, Volume 81, pp. 88-104.
  • Nagar, A., Heragu, S. S., Haddock, J. 1995b. A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem, Journal of Operational Research Society, Volume 46, pp. 721-734.
  • Nawaz, M., Enscore, E. E., Ham, I. 1983. A Heuristic Algorithm for The m-Machine -Job Flowshop Sequencing Problem, OMEGA, Volume 11, pp. 91-95.
  • Neppalli, V. R., Chen C. - L., Gupta J. N. D. 1996. Genetic Algorithms for The Two-Stage Bicriteria Flowshop Problem, European Journal of Operational Research, Volume 95, pp. 356-373.
  • Ogbu, F. A. and Smith, D. K. 1990. The Application of Simulated Annealing Algorithm to The Solution of The n/m/$C_{max}$ Flowshop Problem, Computers and Operations Research, Volume 17, pp. 243-253.
  • Pinedo, M. L. 1995. Scheduling: Theory, Algorithms, and Systems, Prentice-Hall, Englewood.
  • Rajendran, C. 1992. Two-Stage Flowshop Sequencing Problem with Bicriteria, Journal of Operational Research Society, Volume 43, pp. 871-884.
  • Rajendran. C. 1993. Heuristic Algorithm for Scheduling in a Flowshop to Minimize Total Flowtime". International Journal of Production Economics, Volume 29, pp. 65-73.
  • Rajendran. C. 1994a. A Heuristic for Scheduling in Flowshop and Flowline-Based Manufacturing Cell with Multi-criteria, International Journal of Production Research, Volume 32, No: 11, pp. 2541-2558.
  • Rajendran. C. 1994b. A No-wait Flowshop Scheduling Heuristic to Minimize Makespan, Journal of Operational Research Society, Volume 45, pp. 472-478.
  • Rajendran, C. 1995. Heuristic for Scheduling in Flowshop with Multiple Objectives, European Journal of Operational Research, Volume 82, pp. 540-555.
  • Rajendran, C. and Chaudhuri, D. 1990. Heuristic Algorithms for Continuous Flowshop Problem, Naval Research Logistics, Volume 37, pp. 695-705.
  • Rajendran, C., Chaudhuri, D. 1991. An Efficient Heuristic Approach to The Scheduling of Jobs in a Flowshop, European Journal of Operational Research, Volume 61, pp. 318-325.
  • Rajendran, C., Ziegler, H. 1997. An Efficient Heuristic for Scheduling in a FIowsop to Minimize Total Weighted Flowtime of Jobs, European Journal of Operational Research, Volume 103, pp. 129-138.
  • Sayın, S., Karabatı, S. 1999. A Bicriteria Approach to The Two-machine Flow Shop Scheduling Problem, European Journal of Operational Research, Volume i 13, pp. 435-449.
  • Schaffer, J. D. 1985. "Multi-Objective Optimization with Vector Evaluted Genetic Algorithms", International Processing 1st Conferences Genetic Algorithms, pp. 93-100.
  • Selen, W. J., Hott, D. D. 1986. A Mixed-Integer Goal-Programming Formulation of The Standard Flow-Shop Scheduling Problem, Journal of Operational Research Society, Volume 37, No: 12, pp. 1121-1128.
  • Sen, T., Gupta, S. K. 1983. A Branch and Bound to Solve a Bicriterion Scheduling Problem, IEE Transactions, Volume 15, pp. 84-88.
  • Sen, T., Raiszadeh, F.M.E., Dileepan, P. 1988. A Branch-and-Bound Approach to The Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness, Management Science, Volume 34, No: 2, pp. 255-260.
  • Sharadapriyadarshini, B., Rajendran, C. 1997. Formulations and Heuristics for Scheduling in a Buffer-constrained Flowshop and Flowline-Based Manufacturing Cell with Different Buffer-Space Requirements for Jobs: Part 2", International Journal of Production Research, Volume 35, No: 1, pp. 101-122.
  • Sivrikaya-Şerifoğlu, F., Ulusoy G. 1998. A Bicriteria Two-machine Permutation Flowshop Problem, European Journal of Operational Research, Volume 107, pp. 414-430.
  • Su, L.H. and Chou, F. D. 2000. Heuristic for Scheduling in a Two-Machine Bicriteria Dynamic Flowshop with Setup and Processing Times Separated, Production Planning and Control, Volume 11, No: 8, pp. 806-819.
  • T'kindt, V. and Billaut J.C. 2001. Multicriteria Scheduling Problems: A Survey", RAIRO Operations Research, Volume 35, pp. 143-163.
  • T'kindt, V., Billaut, J.C., Proust, C. 2001. Solving a Bicriteria Scheduling Problem on Unrelated Parallel Machines Occurring in The Glass Bottle Industry", European Journal of Operational Research, Volume 135, pp. 42-49.
  • T'kindt, V., Gupta, J. N. D., and J.-C., Proust, C. 2002a. Two-Machine Flowshop Scheduling With a Secondary Criterion, Computers and Operations Research (in press).
  • T'kindt, V., Monmarche, N., Tercinet, F., Laügt, D. 2002b. An Ant Colony Optimization Algorithm to Solve A 2-Machine Bicriteria Flowshop Scheduling Problem, European Journal of Operational Research, Volume 142, pp. 250-257.
  • Van Wassenhove, L. N., Gelders, L. F. 1980. Solving a Bicriterion Scheduling Problem, European Journal of Operational Research, Volume 4, pp. 42-48.
  • Widmer, M., Hertz, A. 1989. A New Heuristic Method for The Flowshop Sequencing Problem, European Journal of Operational Research, Volume 41, pp. 186-193.
  • Wilson, J. M. 1989. Alternative Formulations of a Flow-Shop Scheduling Problem, Journal of Operational Research Society, Volume 40, No: 4, pp. 395-399.
  • Woo, D. S., Yim, H. S. 1998. A Heuristic Algorithm for Mean Flowtime Objective in Flowshop Scheduling", Computers and Operations Research, Volume 25, pp. 175-182.
  • Yeh, W. C. 1999. A New Branch-and- Bound Approach for the n /2/flowshop/ $alpha F+beta C_{max}$ Flowshop Scheduling Problem, Computers & Operations Research, Volume 26, pp. 1293-1310.
APA EREN T, GÜNER E (2004). Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. , 19 - 30.
Chicago EREN Tamer,GÜNER Ertan Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. (2004): 19 - 30.
MLA EREN Tamer,GÜNER Ertan Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. , 2004, ss.19 - 30.
AMA EREN T,GÜNER E Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. . 2004; 19 - 30.
Vancouver EREN T,GÜNER E Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. . 2004; 19 - 30.
IEEE EREN T,GÜNER E "Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması." , ss.19 - 30, 2004.
ISNAD EREN, Tamer - GÜNER, Ertan. "Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması". (2004), 19-30.
APA EREN T, GÜNER E (2004). Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. Mühendislik Bilimleri Dergisi, 10(1), 19 - 30.
Chicago EREN Tamer,GÜNER Ertan Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. Mühendislik Bilimleri Dergisi 10, no.1 (2004): 19 - 30.
MLA EREN Tamer,GÜNER Ertan Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. Mühendislik Bilimleri Dergisi, vol.10, no.1, 2004, ss.19 - 30.
AMA EREN T,GÜNER E Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. Mühendislik Bilimleri Dergisi. 2004; 10(1): 19 - 30.
Vancouver EREN T,GÜNER E Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması. Mühendislik Bilimleri Dergisi. 2004; 10(1): 19 - 30.
IEEE EREN T,GÜNER E "Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması." Mühendislik Bilimleri Dergisi, 10, ss.19 - 30, 2004.
ISNAD EREN, Tamer - GÜNER, Ertan. "Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması". Mühendislik Bilimleri Dergisi 10/1 (2004), 19-30.
Sayfa Oluşturulma Tarihi
07-05-2024 18:23

İLETİŞİM

TÜBİTAK ULAKBİM TR Dizin

Yüzüncüyıl, İşçi Blokları Mahallesi

Muhsin Yazıcıoğlu Caddesi No:51/C

06530 Çankaya / ANKARA +90 (312) 298 92 00

trdizin@tubitak.gov.tr

TÜBİTAK ULAKBİM Ulusal Akademik Ağ ve Bilgi Merkezi Cahit Arf Bilgi Merkezi © Tüm Hakları Saklıdır. Gizlilik Politikası Kullanım Şartları