SavedAdd your journal

Journals / Cankaya University Journal of Science and Engineering / 2010 / Cilt: 7 - Sayı: 2

Çok Kriterli Permütasyon Akış Tipi Çizelgeleme Problemi için Bir Tavlama Benzetimi Yaklaşımı

İzzettin Temiz
Pages
1–1
Publication Date
2010-04-01
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)

The proposed algorithm has obtained efficient solutions in a reasonable computation time.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Most of the studies dealing with the production scheduling problems has focused on single criterion.
📊
Key Findings & Data:However, real-world manufacturing systems require the simultaneous optimization of different criteria.
💡
Conclusion & Impact:The proposed algorithm has obtained efficient solutions in a reasonable computation time.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Multi-criteria scheduling · flow shop scheduling · simulated annealing

Abstract

Most of the studies dealing with the production scheduling problems has focused on single criterion. However, real-world manufacturing systems require the simultaneous optimization of different criteria. In this study, we consider permutation flowshop scheduling problem with the multiobjectives of minimizing makespan, total flowtime and maximum tardiness simultaneously. Three-stage simulated annealing algorithm is proposed to obtain efficient solutions. The proposed algorithm has obtained efficient solutions in a reasonable computation time.

🔖

Cite This Article

Temiz, İ. (2010). Çok Kriterli Permütasyon Akış Tipi Çizelgeleme Problemi için Bir Tavlama Benzetimi Yaklaşımı. Cankaya University Journal of Science and Engineering, Cilt: 7 - Sayı: 2, 1–1. https://ajindex.com/articles/746111

📄 Full Text PDF Viewer

📄

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

References (1)

  1. J. Dubois-Lacoste, M. L´opez-Ib´a˜nez, and T. St¨utzle, A hybrid TP+PLS algorithm for biobjective flow-shop scheduling problems, Computers & Operations Research, article in press, doi:10.1016/j.cor.2010.10.008 [2] B. S. H. Khan, G. Prabhaharan, and P. Asokan, A grasp algorithm for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness, International Journal of Computer Mathematics 84 (2007), 1731–1741. [3] S. Sayin and S. Karabatı, A bicriteria approach to the two-machine flow shop scheduling problem, European Journal of Operational Research 113 (1999), 435–449. [4] B. Tokta¸s, M. Azizo˘glu, and S. K¨oksalan, Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan, European Journal of Operational Research 157 (2004), 286–295. [5] C. J. Liao, W.C. Yu, and C.B. Joe, Bicriterion scheduling in the two-machine flowshop, The Journal of the Operational Research Society 48 (1997), 929–935. [6] R. L. Daniels and R. J. Chambers, Multi-objective flow-shop scheduling, Naval Research Logistics 37 (1990), 981–995. [7] K. Chakravarthy and C. Rajendran, A heuristic for scheduling in a flowshop with the bicriteria of makespan and maximum tardiness minimization, Production Planning and Control 10 (1999), 707–714. [8] D. Ravindran, A. Noorul Haq, S. J. Selvakuar, and R. Sivaraman, Flow shop scheduling with multi objective of minimizing makespan and total flow time, International Journal of Advanced Manufacturing Technology 25 (2005), 1007–1012. [9] T. Pasupathy, C. Rajendran, and R. K. Suresh, A multi-objective genetic algorithm for scheduling in flow shops to minimize the makespan and total flow time of jobs, International Journal of Advanced Manufacturing Technology 27 (2006), 804–815. [10] T. Loukil, J. Teghem, and D. Tuyttens, Solving multi-objective production scheduling problems using metaheuristics, European Journal of Operational Research 161 (2005), 42–61. [11] T. Murata, H. Ishibuchi, and H. Tanaka, Multi-objective genetic algorithms and its applications to flowshop scheduling, Computers and Industrial Engineering 30 (1996), 957–968. [12] S. G. Ponnambalam, H. Jagannathan, M. Kataria, and A. Gadicherla, A TSP-GA multiobjective algorithm for flowshop scheduling, International Journal of Advanced Manufacturing Technology 23 (2004), 909–915. [13] T. K. Varadharajan and C. Rajendran, A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of j