Esnek atölye tipi çizelgeleme problemlerinin meta sezgisel yöntemler ile çözümüne yönelik bir inceleme

Yıl 2016, , 223 - 244, 01.08.2016

Serkan Kaya , Nilgün Fığlalı

https://doi.org/10.16984/saufenbilder.12029

Cited By: 2

Öz

 

Gerçek yaşam uygulamaları arasında yer alan esnek atölye tipi çizelgeleme (EATÇ) problemleri, klasik atölye tipi çizelgeleme (ATÇ) probleminin genişletilmiş halidir. ATÇ problemlerinde paralel makineler yoktur. Atölyede işlerin paralel makinelerde işlenmesi söz konusu olduğunda EATÇ problemi ortaya çıkar. EATÇ problemlerinde işlerin rotaları birbirinden farklıdır ve her iş en az bir operasyondan oluşmaktadır. Bu operasyonlar, birbirine paralel makine setlerinden herhangi birinde işlem görürler. Literatürde ATÇ problemlerine göre EATÇ problemleri üzerine yapılan çalışmalar oldukça sınırlı kalmıştır. Bu araştırmada, EATÇ problemleri üzerine son yıllarda yapılmış ve literatürde yer alan çalışmalar incelenmiştir. Bu problemlerin meta sezgisel yöntemler ile çözümü üzerine elde edilen bulgular ve öneriler sunulmuştur.

 

Anahtar Kelimeler

Esnek atölye tipi çizelgeleme, makine atama, operasyon sıralama, hiyerarşik yaklaşım, bütünleşik yaklaşım

A review on meta-heuristic approaches to solving flexible job shop scheduling problem

Öz

Flexible job shop scheduling (FJSS) problems which are parts of real life applications are the extended case of classical job shop scheduling (JSS) problems. There are no parallel machines at JSS problems. FJSS Problems arise when works need to be done on parallel machines in the workshop. In FJSS problems, jobs have different routes and each job is consisted of at least one operation. These operations are processed by any of the machine sets which are parallel to each other. In literature; the number of studies on FJSS problems are more limited than the one on JSS problems. In this paper, recent studies in the literature on the topic of FJSS problems are reviewed. The findings and recommendations on the solution of this kind of problems by using meta-heuristic methods are presented.

Anahtar Kelimeler

flexible job shop scheduling, machine assignment, operation sequence, hierarchical approach, integrated approach

Kaynakça

• T. Eren ve E. Güner, «A Literature Survey for Multicriteria Scheduling Problems on Single and Parallel Machines,» Journal of The Faculty of Engineering and Architecture of Gazi University, cilt 17, no. 4, pp. 37-69, 2002.
• H. Liu, A. Abraham ve Z. Wang, «A Multi-swarm approach to multi-objective flexible Job-shop scheduling problems,» Fundamental Informatics, cilt 95, pp. 465-489, 2009.
• F. Pezzella, G. Morganti ve G. Ciaschetti, «A genetic algorithm for the flexible job-shop scheduling problem,» Computers & Operations Research, cilt 35, pp. 3202-3212, 2008.
• P. Brandimarte, «Routing and scheduling in a flexible job-shop by tabu search,» Annals of Operations Research, cilt 41, pp. 157-183, 1993.
• J. Paulli, «A hierarchical approach for the FMS scheduling problem,» European Journal of Operational Research, cilt 86, no. 1, pp. 32-42, 1995.
• J. Barnes ve J. Chambers, «Flexible Job Shop Scheduling by tabu search,» Graduate program in operations research and industrial engineering, University of Texas, ORP96-09, Austin, 1996.
• M. Saidi-Mehrabad ve P. Fattahi, «Flexible job shop scheduling with tabu search algorithms,» International Journal Advanced Manufacturing Technology, cilt 32, pp. 563-570, 2007.
• R. Vaessens, E. Aarts ve J. Lenstra, «Job Shop Scheduling by local search,» Informs Journal on Computing, cilt 8, no. 3, pp. 302-317, 1996.
• S. Dauzere-Peres ve J. Paulli, «An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search,» Annals of Operation Research, cilt 70, no. 3, pp. 281-306, 1997.
• E. Hurink, B. Jurisch ve M. Thole, «Tabu search for the job shop scheduling problem with multi-purpose machine,» Operations Research Spectrum, cilt 15, pp. 205-215, 1994.
• M. Mastrolilli ve L. Gambardella, «Effective Neighborhood Functions for the Flexible Job Shop Problem,» Journal of Scheduling, cilt 3, pp. 3-20, 2000.
• H. Chen, J. Ihlow ve C. Lehmann, «A genetic algorithm for flexible Job-shop scheduling,» IEEE international conference on robotics and automation, pp. 1120-1125, 1999.
• H. Jia, A. Nee, J. Fuh ve Y. Zhang, «A modified genetic algorithm for distributed scheduling problems,» International Journal of Intelligent Manufacturing, cilt 14, pp. 351-362, 2003.
• N. Ho ve J. Tay, «GENACE: an efficient cultural algorithm for solving the Flexible Job-Shop Problem,» Congress On Evolutionary Computation CEC2004, pp. 1759-1766, June 2004.
• I. Kacem, S. Hammadi ve P. Borne, «Approach by Localization and Multiobjective Evolutionary Optimization for Flexible Job-Shop Scheduling Problems,» Systems,Man, and Cybernetics—Part c: Applications and Reviews, cilt 32, no. 1, pp. 1-13, 2002.
• I. Kacem, S. Hammadi ve P. Borne, «Approach by localization and genetic manipulation algorithm for flexible job-shop scheduling problem,» Systems, Man, and Cybernetics, pp. 2599-2604, 7-10 October 2001.
• I. Kacem, S. Hammadi ve P. Borne, «Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic,» Mathematics and Computers in Simulation, cilt 60, pp. 245-276, 2002.
• S. Kaya ve N. Fığlalı, «Multi Objective Flexible Job Shop Scheduling Problems,» Sigma Journal of Engineering and Natural Sciences, cilt 31, no. 4, pp. 605-623, 2013.
• N. Kundakçı, «Üretim Sistemlerinde Dinamik İş Çizelgeleme Problemlerinin Sezgisel Yöntemlerle Çözülmesi, Ph.D. Thesis,» Pamukkale Üniversitesi, Sosyal Bilimler Enstitüsü, Denizli, 2013.
• M. Gonzalez, C. Vela ve R. Varela, «Scatter search with path relinking for the flexible job shop scheduling problem,» European Journal of Operational Research, cilt 245, pp. 35-45, 2015.
• K. Gao, P. Suganthan, T. Chua, C. Chong, T. Cai ve Q. Pan, «A two-stage artificial bee colony algorithm scheduling flexible job-shop scheduling problem with new job insertion,» Expert Systems with Applications, cilt 42, pp. 7652-7663, 2015.
• K. Gao, P. Suganthan, Q. Pan ve M. Taşgetiren, «An effective discrete harmony search algorithm for flexible job shop scheduling problem with fuzzy processing time,» International Journal of Production, cilt 53, no. 19, pp. 5896-5911, 2015.
• A. Dosdoğru, M. Göçken ve F. Geyik, «Integration of genetic algorithm and Monte Carlo to analyze the effect of routing flexibility,» International Journal Advanced Manufacturing Technology, cilt 81, pp. 1379-1389, 2015.
• E. Sirkeci, «Esnek atölye tipi çizelgeleme problemi için çözüm yaklaşımları: Savunma sanayinde bir uygulama, Yaynlanmamış Yüksek Lisans Tezi,» Gazi Üniversitesi, Fen Bilimleri Enstitüsü, 2015.
• M. Direkli, «A Heuristic Approach on Flexible Job-Shop Scheduling Problem with Maintenance Activities by Considering Weight of the Jobs, Master Thesis,» University Of Gaziantep, Graduate School Of Natural & Applied Sciences, 2015.
• M. Tayebi Araghi, F. Jolai ve M. Rabiee, «Incorporating learning effect and deterioration for solving a SDST flexible job-shop scheduling problem with a hybrid meta-heuristic approach,» International Journal of Computer Integrated Manufacturing, cilt 27, no. 8, pp. 733-746, 2014.
• Y. Demir ve S. İşleyen, «An effective genetic algorithm for flexible job-shop scheduling with overlapping in operations,» International Journal of Production Research, cilt 52, no. 13, pp. 3905-3921, 2014.
• D. Lei ve X. Guo, «Variable neighbourhood search for dual-resource constrained flexible job shop scheduling,» International Journal of Production Research, cilt 52, no. 9, pp. 2519-2529, 2014.
• D. Lei, «Co-evolutionary Genetic Algorithm for Fuzzy Flexible Job Shop Scheduling,» Applied Soft Computing, cilt 12, no. 8, pp. 2237-2245, 2012.
• O. Gholami ve Y. Sotskov, «A fast heuristic algorithm for solving parallel-machine job-shop scheduling problems,» International Journal Advanced Manufacturing Technology, cilt 70, pp. 531-546, 2014.
• M. Ziaee, «A heuristic algorithm for solving flexible job shop scheduling problem,» International Journal Advanced Manufacturing Technology, cilt 71, pp. 519-528, 2014.
• A. Thammano ve A. Phu-ang, «A Hybrid Artificial Bee Colony Algorithm with Local Search for Flexible Job-Shop Scheduling Problem,» Procedia Computer Science, cilt 20, pp. 96-101, 2013.
• Y. Yuan, H. Xu ve J. Yamg, «A hybrid harmony search algorithm fort he flexible job shop scheduling problem,» Applied Soft Computing, cilt 13, pp. 3259-3272, 2013.
• Y. Wang, H. Yin ve K. Qin, «A novel genetic algorithm for flexible job shop scheduling problems with machine disruptions,» International Journal Advanced Manufacturing Technology, cilt 68, pp. 1317-1326, 2013.
• Y. Yuan ve H. Xu, «An integrated search heuristic for large-scale flexible job shop scheduling problems,» Computers & Operations Research, cilt 40, pp. 864-877, 2013.
• Y. Demir ve S. İşleyen, «Evaluation of mathematical models for flexible job-shop scheduling problems,» Applied Mathematical Modelling, cilt 37, pp. 977-988, 2013.
• B. Meto, «Esnek atölye tipi çizelgeleme problemi için bir hibrid genetik algoritma yaklaşımı, Yüksek Lisans Tezi,» TOBB Ekonomi ve Teknoloji Üniversitesi, Fen Bilimleri Enstitüsü, 2013.
• L. Wang, S. Wang, Y. Xu, G. Zhou ve M. Liu, «A bi-population based estimation of distribution algorithm fort he flexible job-shop scheduling problem,» Computers & Industrial Engineering, cilt 62, pp. 917-926, 2012.
• H. Karimi, S. Rahmati ve M. Zandieh, «An efficient knowledge-based algorithm fort he flexible job shop scheduling problem,» Knowledge-Based Systems, cilt 36, pp. 236-244, 2012.
• V. Roshanaei, «Mathematical Modelling and Optimization of Flexible Job Shops Scheduling Problem, Degree of Master of Science,» University of Windsor,Industrial Manufacturing Systems Engineering, 2012.
• B. Ak, «Seçilmiş bir endüstriyel tesiste üretim çizelgeleme problemi ve genetik algoritma yöntemi ile optimizasyon, Yüksek Lisans Tezi,» Ondokuz Mayıs Üniversitesi, Fen Bilimleri Enstitüsü, 2012.
• Y. Demir, «Esnek atölye tipi çizelgeleme problemleri için kafile aktarımı stratejisi: otomotiv sektöründe bir uygulama, Yüksek Lisans Tezi,» Atatürk Üniversitesi, Fen Bilimleri Enstitüsü, 2012.
• G. Zhang, L. Gao ve Y. Shi, «An effective genetic algorithm for the flexible job-shop scheduling problem,» Expert Systems with Applications, cilt 38, pp. 3563-3573, 2011.
• L. Xing, Y. Chen ve K. Yang, «Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems,» Computational Optimization and Applications, cilt 48, pp. 139-155, 2011.
• C. Gutierrez ve I. Garcia-Magarino, «Modular design of a hybrid genetic algorithm for a flexible job–shop scheduling problem,» Knowledge-Based Systems, cilt 24, pp. 102-112, 2011.
• E. Özdöl, «A Genetic Algorithm For A Flexible Job Shop Scheduling Problem With Sequence Dependent Setup Times, Master Thesis,» Dokuz Eylül University, Graduate School Of Natural And Applied Sciences, 2011.
• M. Amiri, M. Zandieh, M. Yazdani ve A. Bagheri, «A variable neighbourhood search algorithm for the flexible job-shop scheduling problem,» International Journal of Production Research, cilt 48, pp. 5671-5689, 2010.
• L. De Giovanni ve F. Pezzella, «An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem,» European Journal of Operational Research, cilt 20, pp. 395-408, 2010.
• A. Bagheri, M. Zandieh, I. Mahdavi ve M. Yazdani, «An artificial immune algorithm for the flexible job-shop scheduling problem,» Future Generation Computer Systems, cilt 26, pp. 533-541, 2010.
• A. Aladağ, «Tekrar işlemeli esnek atölye tipi çizelgeleme problemi için yapay bağışıklık sistemi ile bir çözüm yaklaşımı, Yüksek Lisans Tezi,» Eskişehir Osmangazi Üniversitesi, Fen Bilimleri Enstitüsü, 2010.
• C. Özgüven, L. Özbakır ve L. Yavuz, «Mathematical models for job-shop scheduling problems with routing and process plan flexibility,» Applied Mathematical Modelling, cilt 34, pp. 1539-1548, 2010.
• F. Defersha ve M. Chen, «A parallel genetic algorithm for a flexible job-shop scheduling problem with sequence dependent setups,» International Journal Advanced Manufacturing Technology, cilt 49, pp. 263-279, 2010.
• D. Lei, «A genetic algorithm for flexible job shop scheduling with fuzzy processing time,» International Journal of Production Research, cilt 48, pp. 2995-3010, 2010.
• S. Fahmy, S. Balakrishnan ve T. ElMekkawy, «A generic deadlock-free reactive scheduling approach,» International Journal of Production Research, cilt 47, pp. 5657-5676, 2009.
• B. Girish ve N. Jawahar, «Scheduling job shop associated with multiple routings with genetic and ant colony heuristics,» International Journal of Production Research, cilt 47, pp. 3891-3917, 2009.
• M. Yazdani, M. Gholami, M. Zandieh ve M. Mousakhani, «A Simulated annealing algorithm for flexible job-shop scheduling problem,» Journal of Applied Sciences, cilt 9, pp. 662-670, 2009.
• M. Yazdani, M. Amiri ve M. Zandieh, «Flexible job-shop scheduling with parallel variable neighborhood search algorithm,» Expert Systems with Applications, cilt 37, pp. 678-687, 2010.
• L. Xing, Y. Chen ve K. Yang, «Double layer ACO algorithm for the multi-objective FJSSP,» New Generation Computing, cilt 26, pp. 313-327, 2008.
• J. Chen, K. Chen, C. Wu ve W. Chen, «A study of the flexible job shop scheduling problem with parallel machines and reentrant process,» International Journal of Advanced Manufacturing Technology, cilt 39, pp. 344-354, 2008.
• D. Lei ve X. Guo, «Solving Fuzzy Flexible Job Shop Scheduling Problems Using Genetic Algorithm,» Seventh International Conference on Machine Learning and Cybernetics, pp. 1014-1019, 12-15 July 2008.
• N. Zribi, I. Kacem, A. El Kamel ve P. Borne, «Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization,» Systems, Man, And Cybernetics—Part C: Applications And Reviews, cilt 37, pp. 652-662, 2007.
• P. Fattahi, M. Mehrabad ve F. Jolai, «Mathematical modeling and heuristic approaches to flexible job shop scheduling problems,» Journal of Intelligent Manufacturing, cilt 18, pp. 331-342, 2007.
• N. Ho, J. Tay ve E. Lai, «An effective architecture for learning and evolving flexible job-shop schedules,» European Journal of Operational Research, cilt 179, pp. 316-333, 2007.
• N. Liouane, I. Saad, S. Hammadi ve P. Borne, «Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production,» Int. Journal of Computers, Communications & Control, cilt 2, no. 2, pp. 174-184, 2007.
• N. Zribi, I. Kacem, A. El Kamel ve P. Borne, «Optimization by phases for the flexible job shop scheduling problem,» In The fifth Asian control conference, cilt 3, pp. 1889-1895, 2004.
• A. Baykasoğlu, «Linguistic-based meta-heuristic optimization model for flexible job shop scheduling,» International Journal of Production Research, cilt 40, pp. 4523-4543, 2002.
• J. Gao, L. Sun ve M. Gen, «A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems,» Computers & Operations Research, cilt 35, pp. 2892-2907, 2008.
• A. Hmida, M. Haouari, M. Huguet ve P. Lopez, «Discrepancy search for the flexible job shop scheduling problem,» Computers & Operations Research, cilt 37, pp. 2192-2201, 2010.
• M. Gonzalez, C. Vela ve R. Varela, «An efficient memetic algorithm for the flexible job shop with setup times,» ICAPS, pp. 91-99, 2013.
• W. Bozejko, M. Uchronski ve M. Wodecki, «Parallel hybrid meta heuristics for the flexible job shop problem,» Computers & Industrial Engineering, cilt 59, no. 2, pp. 323-333, 2010.
• T. Chiang ve H. Lin, «A simple and effective evolutionary algorithm for multi-objective flexible job shop scheduling,» International Journal of Production Economics, cilt 141, no. 1, pp. 87-98, 2013.
• S. Wang, L. Wang, Y. Xu ve M. Liu, «An Effective Estimation of Distribution Algorithm for the Flexible Job Shop Scheduling Problem with Fuzzy Processing Time,» International Journal of Production Research, cilt 51, no. 12, pp. 3778-3793, 2013.
• L. Wang, G. Zhou, Y. Xu ve M. Liu, «A Hybrid Artificial Bee Colony Algorithm for the Fuzzy Flexible Job Shop Scheduling Problem,» International Journal of Production Research, cilt 51, no. 12, pp. 3593-3608, 2013.
• W. Xia ve Z. Wu, «An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems,» Computers & Industrial Engineering, cilt 48, pp. 409-425, 2005.
• F. Fattahi, F. Jolai ve J. Arkat, «Flexible job shop scheduling with overlapping in operations,» Applied Mathematical Modeling, cilt 33, pp. 3076-3087, 2009.
• H. Farughi, B. Yegane, H. Soltanpanah, F. Zaheri ve F. Naseri, «Considering The Flexibility and Overlapping in Operation in Job Shop Scheduling Based on Meta-heuristic Algorithms,» Australian Journal of Basic and Applied Sciences, cilt 5, no. 11, pp. 526-533, 2011.
• S. Lawrence, «Supplement to resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques,» Carnegie-Mellon University, Pittsburgh, 1984.
• J. Muth ve G. Thompson, «Industrial scheduling,» Prentice- Hall, Englewood Cliffs, 1963.
• O. Gholami ve Y. Sotskov, «Solving parallel machines jobshop scheduling problems by adaptive algorithm,» International Journal of Production Research, cilt 52, no. 13, pp. 3888-3904, 2014.
• J. Li, Q. Pan, P. Suganthan ve T. Chua, «A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem,» Int. Journal of Advanced Manufacturing Technology, cilt 52, pp. 683-697, 2011.
• W. Bozejko, M. Uchronski ve M. Wodecki, «The new golf neighborhood for the flexible job shop problem,» Procedia Computing, cilt 1, pp. 289-296, 2010.
• L. Xing, Y. Chen, P. Wang, Q. Zhao ve J. Xiong, «A knowledge-based ant colony optimization for flexible job shop scheduling problems,» Applied Soft Computing, cilt 10, pp. 888-896, 2010.
• L. Wang, G. Zhou, Y. Xu ve M. Liu, «An enhanced pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling,» International Journal Advanced Manufacturing Technology, cilt 60, pp. 1111-1123, 2012.
• N. Najid, S. Dauzere-Peres ve A. Zaidat, «A modified simulated annealing method for flexible job shop scheduling problem,» International Conference on Systems, Man, and Cybernetics, cilt 5, no. 6, pp. 89-94, 2002.
• K. Gao, P. Suganthan ve T. Chua, «Pareto-based discrete harmony search algorithm for flexible job shop scheduling,» 12th International Conference on Intelligent Systems Design and Applications, pp. 953-956, 2012.
• S. Habib, A. Rahmati ve M. Zandieh, «A new biogeography-based optimization (BBO) algorithm for the flexible job shop scheduling problem,» Int. Journal of Advanced Manufacturing Technology, cilt 58, pp. 1115-1129, 2012.
• R. Abumaizar ve J. Svestka, «Rescheduling job shops under random disruptions,» International Journal Production Research, cilt 35, no. 7, pp. 2065-2082, 1997.
• J. Tang, G. Zhang, B. Lin ve B. Zhang, «A Hybrid Algorithm For Flexible Job-Shop Scheduling Problem,» Procedia Engineering, cilt 15, pp. 3678-3683, 2011.
• A. Nasr ve T. ElMekkawy, «An Efficient Hybridized Genetic Algorithm Architecture For The Flexible Job Shop Scheduling Problem,» Flexible Services & Manufacturing Journal, cilt 23, no. 1, pp. 64-85, 2011.
• G. Zhang, L. Gao, X. Li ve P. Li, «Variable Neighborhood Genetic Algorithm for the Flexible Job Shop Scheduling Problems,» Intelligent Robotics and Applications, First International Conference, ICIRA 2008, pp. 503-512, 1 October 2008.
• H. Zhang ve M. Gen, «Multistage-based genetic algorithm for flexible job-shop scheduling problem,» International Journal of Complexity, cilt 11, pp. 223-232, 2005.
• F. Chan, S. Chung ve P. Chan, «An adaptive genetic algorithm with dominated genes for distributed scheduling problems,» Expert Systems with Applications, cilt 29, pp. 364-371, 2005.
• F. Chan, S. Chung, L. Chan, G. Finke ve M. Tiwari, «Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach,» Robotics and Computer-Integrated Manufacturing, cilt 22, pp. 493-504, 2006.
• F. Chan, S. Chung ve P. Chan, «Application of genetic algorithms with dominated genes in a distributed scheduling problem in flexible manufacturing,» Int. Journal of Production Research, cilt 44, pp. 523-543, 2006.
• Z. Ong, J. Tay ve C. Kwoh, «Applying the Clonal Selection Principle to Find Flexible Job-Shop Schedules,» Lecture Notes in Computer Science, cilt 3627, pp. 442-455, 2005.
• S. Fahmy, T. ElMekkawy ve S. Balakrishnan, «Job shop deadlock-free scheduling using mixed integer programming and rank matrices,» International Systems, Man, and Cybernetics, cilt 47, pp. 2776-2781, 2007.
• V. Subramaniam ve A. Raheja, «mAOR: a heuristic-based reactive repair mechanism for job shop schedules,» International Journal of Advanced Manufacturing Technology, cilt 22, pp. 669-680, 2003.
• R. Sarker, H. Abbas ve C. Newton, «Solving multi-objective optimization problems using evolutionary algorithm,» Proceedings of International CIMCA Conference, 9-11 July 2001.
• B. Jurisch, «Scheduling Jobs in Shops with Multi-purpose Machines, Ph.D. Thesis,» Universitat Osnabruck, Fachbereich Mathematik/Informatik, 1992.
• A. Dosdoğru, «Dynamic Flexible Job Shop Scheduling with Simulation Optimization by Using Genetic Algorithm, Master Thesis,» University Of Gaziantep, Graduate School Of Natural & Applied Sciences, 2012.
• B. Süer, «Order-Driven Flexibility Management In Make-To-Order Companies With Flexible Shops, Master Thesis,» Middle East Technical University, The Graduate School Of Natural And Applied Sciences, 2009.
• E. Büyükköprü, «Flexible Job Shop Scheduling Via Simulation Under Sequence Dependent Setup Times, Master Thesis,» Dokuz Eylül University, Graduate School Of Natural And Applied Sciences, 2005.
• K. Shanker ve Y. Tzen, «A Loading and Dispatching Problem in a Random Flexible Manufacturing System,» International Journal of Production Research, cilt 23, no. 3, pp. 579-595, 1985.
• M. Goswami, M. Tiwari ve S. Mukhopadyay, «An Integrated Approach to Solve Tool-Part Grouping, Job Allocation and Scheduling Problems in a Flexible Manufacturing System,» International Journal of Advanced Manufacturing Technology, cilt 35, no. 11, pp. 1145-1155, 2008.
• M. Montazeri ve L. Van Wassenhove, «Analysis of Scheduling Rules for an FMS,» International Journal of Production Research, cilt 28, no. 4, pp. 785-802, 1990.
• A. Türkyılmaz ve S. Bulkan, «A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution,» International Journal of Production Research, cilt 53, no. 6, pp. 1832-1848, 2015.
• M. Mousakhani, «Sequence-dependent setup time flexible job shop scheduling problem to minimise total tardiness,» International Journal of Production Research, cilt 51, no. 12, pp. 3476-3487, 2013.
• N. Zribi, A. El Kamel ve P. Borne, «Total Tardiness in a Flexible Job-Shop,» IMACS Multiconference on Computational Engineering in Systems Applications (CESA), pp. 1543-1549, 4-6 October 2006.
• Y. Jang, K. Kım, S. Jang ve J. Park, «Flexible job shop scheduling with multi-level job structures,» JSME International Journal Series, Special Issue on Advanced Production Scheduling, cilt 46, pp. 33-38, 2003.
• R. Zhang ve C. Wu, «A Simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardiness objective,» Computers & Operations Research, cilt 38, pp. 854-867, 2011.
• H. Tekbaş, «Esnek Sipariş Tipi Üretim Sistemlerinde Müşteri Siparişlerinin Çizelgelenmesi, Doktora Tezi,» İstanbul Teknik Üniversitesi, Fen Bilimleri Enstitüsü, 2011.
• J. Kunadilok, «Heuristics For Scheduling Reentrant Flexible Job Shops With Sequence-Dependent Setup Times and Limited Buffer Capacities, Ph.D. Thesis,» Clemson University, A Dissertation Presented to the Graduate School of Clemson University, USA, 2007.
• M. Boran, «Heuristic operations scheduling in a flexible job shop environment using priority dispatching rules, Ph.D. Thesis,» Dokuz Eylül University, Graduate School Of Natural And Applied Sciences, 2000.
• A. Baykasoglu ve L. Özbakır, «Analyzing the effect of dispatching rules on the scheduling performance through grammar based flexible scheduling system,» Int. Journal Production Economics, cilt 124, pp. 369-381, 2010.
• M. Weng, Z. Wu, G. Qi ve L. Zheng, «Multi-agent-based workload control for make-to order manufacturing,» International Journal of Production Research, cilt 46, pp. 2197-2213, 2008.
• M. Gomes, A. Barbosa-Povoa ve A. Novais, «Optimal scheduling for flexible job shop operation,» International Journal of Production Research, cilt 43, pp. 2323-2353, 2005.
• Z. Wu ve M. Weng, «Multiagent Scheduling Method With Earliness and Tardiness Objectives in Flexible Job Shops,» Transactıons On Systems, Man, And Cybernetıcs—Part B: Cybernetıcs, cilt 35, no. 2, pp. 293-301, 2005.
• R. Alvarez-Valdes, A. Fuertes, J. Tamarit, G. Gimenez ve R. Ramos, «A heuristic to schedule flexible job-shop in a glass factory,» European Journal of Operational Research, cilt 165, pp. 525-534, 2005.
• K. Jansen, M. Mastrolillli ve R. Solis-oba, «Approximation Algorithms for Flexible Job Shop Problems,» International Journal of Foundations of Computer Science, cilt 16, pp. 361-379, 2005.
• P. Bruker ve R. Schlie, «Job-shop scheduling with multi-purpose machines,» Computing, cilt 45, no. 4, pp. 369-375, 1990.
• T. Eren ve E. Güner, «Çok ölçütlü akış tipi çizelgeleme problemleri için bir literatür taraması,» Pamukkale Üniversitesi Mühendislik Fakültesi Mühendislik Bilimleri Dergisi, cilt 10, no. 1, pp. 19-30, 2004.