Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends
| Autor: | Mehmet Mutlu Yenisey, Betul Yagmahan |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Rate-monotonic scheduling
Information Systems and Management Job shop scheduling Operations research Computer science Strategy and Management Flow shop scheduling Dynamic priority scheduling Management Science and Operations Research Multiprocessor scheduling Fair-share scheduling Scheduling (computing) |
| Zdroj: | Omega. 45:119-135 |
| ISSN: | 0305-0483 |
| DOI: | 10.1016/j.omega.2013.07.004 |
| 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: |
|
Full Text from ScienceDirect