Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends


YENİSEY M. M. , YAĞMAHAN B.

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, vol.45, pp.119-135, 2014 (Peer-Reviewed Journal) identifier identifier

  • Publication Type: Article / Review
  • Volume: 45
  • Publication Date: 2014
  • Doi Number: 10.1016/j.omega.2013.07.004
  • Journal Name: OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE
  • Journal Indexes: Science Citation Index Expanded, Social Sciences Citation Index, Scopus
  • Page Numbers: pp.119-135
  • Keywords: Flow shop, Scheduling, Multi-objective, Literature review, Research directions, ANT COLONY OPTIMIZATION, GENETIC LOCAL SEARCH, PARTICLE SWARM OPTIMIZATION, MINIMIZE MAKESPAN, MAXIMUM TARDINESS, BOUND APPROACH, N-JOB, ALGORITHM, BICRITERIA, 2-MACHINE

Abstract

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.