Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
| Autor: | Yenisey, Mehmet Mutlu |
|---|---|
| Přispěvatelé: | Uludağ Üniversitesi/Mühendislik Fakültesi/Endüstri Mühendisliği Bölümü., Yağmahan, Betül, J-2416-2015, B-5557-2017 |
| Jazyk: | angličtina |
| Rok vydání: | 2014 |
| Předmět: |
Literature review
Research directions Multi-objective Scheduling Operations research & management science Particle swarm optimization Business & economics Minimize makespan Management Algorithm Ant colony optimization 2-machine Genetic local search Flow Shop Scheduling Permutation Flowshop Scheduling Problem Maximum tardiness Bicriteria Flow shop N-job Bound approach |
| Popis: | The flow shop scheduling problem is finding a sequence given n jobs with same order at m machines according to certain performance measure(s). The job can be processed on at most one machine; meanwhile one machine can process at most one job. The most common objective for this problem is makespan. However, many real-world scheduling problems are multi-objective by nature. Over the years there have been several approaches used to deal with the multi-objective flow shop scheduling problems (MOFSP). Hence, in this study, we provide a brief literature review of the contributions to MOFSP and identify areas of opportunity for future research. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|