Akademik Veri Yönetim Sistemi
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, cilt.45, ss.119-135, 2014 (SCI-Expanded)
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. (C) 2013 Elsevier Ltd. All rights reserved.