Journals / Enderun / 2017 / Cilt: 1 - Sayı: 1

SUPPLY CHAIN MANAGEMENT – ENTERPRISE SYSTEM INTEGRATION AND SUPPLY CHAIN RESOURCE PLANNING

ESNEK AKIŞ TİPİ ÇİZELGELEME PROBLEMİ ÜZERİNE LİTERATÜR TARAMASI

Journal
Enderun
Pages
1–27
Publication Date
2017-03-15
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this study 132 papers on flexible flowshop scheduling problem were sequenced according to publication date, process complexity, scheduling criteria and method(s) used for solution and classified as 2, 3 and multi stages.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Flexible flowshop scheduling problem is a kind of problem that has serial stages, which at least one of them has parallel machines and that jobs follow the same route.
📊
Key Findings & Data:It can be considered as flowshop scheduling problem with parallel machines or parallel machine scheduling problem with multi stages.
💡
Conclusion & Impact:In this study 132 papers on flexible flowshop scheduling problem were sequenced according to publication date, process complexity, scheduling criteria and method(s) used for solution and classified as 2, 3 and multi stages.
🔬Design:Review & Systematic Survey
📍Scope:Comprehensive Sample
⚙️Variables:Esnek akış tipi çizelgeleme problemi · çizelgeleme · Flexible flowshop scheduling problem

Abstract

Flexible flowshop scheduling problem is a kind of problem that has serial stages, which at least one of them has parallel machines and that jobs follow the same route. It can be considered as flowshop scheduling problem with parallel machines or parallel machine scheduling problem with multi stages. There is not a recent literature review, though there are reviews made in the past. In this study 132 papers on flexible flowshop scheduling problem were sequenced according to publication date, process complexity, scheduling criteria and method(s) used for solution and classified as 2, 3 and multi stages.

Özet

Esnek akış tipi çizelgeleme problemi birbirine seri aşamaları olan, bu aşamalardan en az birinde paralel makineler bulunan ve işlerin aynı rotayı takip ettiği çizelgeleme problemi tipidir. Akış tipi çizelgeleme probleminin paralel makineli hali veya paralel makine çizelgeleme probleminin çok aşamalı hali olarak da düşünülebilir. Bu konuda geçmiş yıllarda yapılmış literatür çalışmaları olmasına rağmen güncel bir literatür taraması bulunmamaktadır. Bu çalışmada esnek akış tipi çizelgeleme problemi üzerine yapılmış 132 çalışma yayınlandıkları yıla, süreç karmaşıklığına, çizelgeleme kriterine ve çözümde kullanılan yöntem(ler)e göre sıralanmış, 2, 3 ve çok aşamalı olarak sınıflandırılmıştır.

🔖

Cite This Article

ASLAN, E. (2017). SUPPLY CHAIN MANAGEMENT – ENTERPRISE SYSTEM INTEGRATION AND SUPPLY CHAIN RESOURCE PLANNING. Enderun, Cilt: 1 - Sayı: 1, 1–27. https://ajindex.com/articles/37

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (12)

  1. Adler, L., Fraiman, N., Kobacker, E., Pinedo, M., Plotnicoff, J.C. and Wu, T.P. (1993). BPSS: A scheduling support system for packing industry, Operations Research, 41(4), 641-648.
  2. Adressi, A., Hassanpour, S., & Azizi, V. (2016). Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown. Decision Science Letters, 5(1), 157-168.
  3. Agnetis, A., A. Pacifici, F. Rossi, M. Lucertini, S. Nicoletti, F. Nicolo, G. Oriolo, D. Pacciarelli and E. Pesaro. (1997). Scheduling of flexible flow lines in an automobile assembly plant, European Journal of Operational Research, 97, 348-362.
  4. Ahonen, H., & de Alvarenga, A. G. (2017). Scheduling flexible flow shop with recirculation and machine sequence-dependent processing times: formulation and solution procedures. The International Journal of Advanced Manufacturing Technology, 89(1-4), 765-777.
  5. Akrami, B., B. Karimi and S.M.M. Hosseini. (2006). Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: The finite horizon case, Applied Mathematics & Computation, 183, 634-645.
  6. Alisantoso, D., L.P. Khoo and P.Y. Jiang. (2003). “An immune algorithm approach to the scheduling of a flexible PCB flow shop”, International Journal of Advanced Manufacturing Technologies, 22, 819-827.
  7. Allaoui, H. and A. Artiba. (2006). “Scheduling two-stage hybrid flow shop with availability constraints”, Computers & Operations Research, 33, 1399-1419.
  8. Amin-Naseri, M.R. and M.A. Beheshti-Nia. (2009). “Hybrid flow shop scheduling with parallel batching”, International Journal of Production Economics, 117, 185-196.
  9. Arthanary, T.S. and K.G. Ramaswamy (1971), An extension of two machines sequencing problem, Opsearch, 8, 10-22.
  10. Asefi, H.; F. Jolahi, M. Rabiee, M.E. Tayebi Araghi (2014). “A hybrid NSGA-II and VNS for solving a bi-objective no-wait flexible flowshop scheduling problem”, The International Journal of Advanced Manufacturing Technology, Attar, S. F., Mohammadi, M., & Tavakkoli-Moghaddam, R. (2013). Hybrid flexible flowshop scheduling problem with unrelated parallel machines and limited waiting times. The International Journal of Advanced Manufacturing Technology, 68(5-8), 1583-1599.
  11. Azizoğlu, M., E. Çakmak and S. Kondakci. (2001). “A flexible flowshop problem with total flow time minimization”, European Journal of Operational Research, 132, 528-538.
  12. Baker, K.R. and D. Trietsch. (2009). Principles of Sequencing and Scheduling. New Jersey