Autor: |
Nevzatcem Öztuna, Mert Demirkan, Ali Ozan Özkul, Yıldırımşan Büyükmertoğlu, Ceren Çelik, Gamze Küçük, Ezgi Çağlar Nizam, Damla Yüksel, Ayhan Özgür Toy |
Rok vydání: |
2020 |
Předmět: |
|
Zdroj: |
Lecture Notes in Mechanical Engineering ISBN: 9783030627836 |
DOI: |
10.1007/978-3-030-62784-3_68 |
Popis: |
In this study, we consider the flexible job-shop scheduling problem at a local metal sheet processing company. We aim to develop a model and an algorithm to generate a weekly production plan for the company. The objective is to minimize the makespan while meeting the demands of products for a given planning horizon. First, we provide an LP formulation of this problem. The computational complexity of the problem is NP-hard, hence the input data prohibits obtaining the optimal solution in a reasonable time. Therefore, we implement a metaheuristic and several rule-based heuristics. These are Genetic Algorithm, Giffler and Thompson’s Algorithm, and three other Rule-Based Heuristic Algorithms that we developed. We first test our model and heuristics over a set of sample instances, then we solve for the real data. Our experimental study indicates that one of the rule-based heuristics we developed outperforms others in most of the instances. |
Databáze: |
OpenAIRE |
Externí odkaz: |
|