Fuzzy job-shop scheduling problems

A review

Salwani Abdullah, Majid Abdolrazzagh-Nezhad

Research output: Contribution to journalArticle

37 Citations (Scopus)

Abstract

Fuzzy job-shop scheduling problems (Fuzzy JSSPs) are a class of combinational optimization problems known as non-deterministic polynomial-hard problems. In recent decades, a number of researchers have expanded the theoretical models of Fuzzy JSSPs and introduced algorithms to solve them. This paper reviews the classification of Fuzzy JSSPs, constraints and objectives investigated in Fuzzy JSSPs, and the methodologies applied in solving Fuzzy JSSPs. The paper centers on reviewing meta-heuristic algorithms as state-of-the-art algorithms proposed for Fuzzy JSSPs. These algorithms are analyzed in three steps, namely, pre-processing, initialization procedures, and improvement algorithms. Finally, possible suggestions for future studies are obtained from this survey.

Original languageEnglish
Pages (from-to)380-407
Number of pages28
JournalInformation Sciences
Volume278
DOIs
Publication statusPublished - 10 Sep 2014

Fingerprint

Job Shop Scheduling Problem
Heuristic algorithms
Initialization
Metaheuristics
Heuristic algorithm
Theoretical Model
Preprocessing
Review
Job shop scheduling
Polynomials
Optimization Problem
Polynomial
Methodology
Processing

Keywords

  • Fuzzy job-shop scheduling
  • Meta-heuristic algorithm
  • Review

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Cite this

Fuzzy job-shop scheduling problems : A review. / Abdullah, Salwani; Abdolrazzagh-Nezhad, Majid.

In: Information Sciences, Vol. 278, 10.09.2014, p. 380-407.

Research output: Contribution to journalArticle

Abdullah, Salwani ; Abdolrazzagh-Nezhad, Majid. / Fuzzy job-shop scheduling problems : A review. In: Information Sciences. 2014 ; Vol. 278. pp. 380-407.
@article{020ce6f9650b4979910fe1cee7f3e73b,
title = "Fuzzy job-shop scheduling problems: A review",
abstract = "Fuzzy job-shop scheduling problems (Fuzzy JSSPs) are a class of combinational optimization problems known as non-deterministic polynomial-hard problems. In recent decades, a number of researchers have expanded the theoretical models of Fuzzy JSSPs and introduced algorithms to solve them. This paper reviews the classification of Fuzzy JSSPs, constraints and objectives investigated in Fuzzy JSSPs, and the methodologies applied in solving Fuzzy JSSPs. The paper centers on reviewing meta-heuristic algorithms as state-of-the-art algorithms proposed for Fuzzy JSSPs. These algorithms are analyzed in three steps, namely, pre-processing, initialization procedures, and improvement algorithms. Finally, possible suggestions for future studies are obtained from this survey.",
keywords = "Fuzzy job-shop scheduling, Meta-heuristic algorithm, Review",
author = "Salwani Abdullah and Majid Abdolrazzagh-Nezhad",
year = "2014",
month = "9",
day = "10",
doi = "10.1016/j.ins.2014.03.060",
language = "English",
volume = "278",
pages = "380--407",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Fuzzy job-shop scheduling problems

T2 - A review

AU - Abdullah, Salwani

AU - Abdolrazzagh-Nezhad, Majid

PY - 2014/9/10

Y1 - 2014/9/10

N2 - Fuzzy job-shop scheduling problems (Fuzzy JSSPs) are a class of combinational optimization problems known as non-deterministic polynomial-hard problems. In recent decades, a number of researchers have expanded the theoretical models of Fuzzy JSSPs and introduced algorithms to solve them. This paper reviews the classification of Fuzzy JSSPs, constraints and objectives investigated in Fuzzy JSSPs, and the methodologies applied in solving Fuzzy JSSPs. The paper centers on reviewing meta-heuristic algorithms as state-of-the-art algorithms proposed for Fuzzy JSSPs. These algorithms are analyzed in three steps, namely, pre-processing, initialization procedures, and improvement algorithms. Finally, possible suggestions for future studies are obtained from this survey.

AB - Fuzzy job-shop scheduling problems (Fuzzy JSSPs) are a class of combinational optimization problems known as non-deterministic polynomial-hard problems. In recent decades, a number of researchers have expanded the theoretical models of Fuzzy JSSPs and introduced algorithms to solve them. This paper reviews the classification of Fuzzy JSSPs, constraints and objectives investigated in Fuzzy JSSPs, and the methodologies applied in solving Fuzzy JSSPs. The paper centers on reviewing meta-heuristic algorithms as state-of-the-art algorithms proposed for Fuzzy JSSPs. These algorithms are analyzed in three steps, namely, pre-processing, initialization procedures, and improvement algorithms. Finally, possible suggestions for future studies are obtained from this survey.

KW - Fuzzy job-shop scheduling

KW - Meta-heuristic algorithm

KW - Review

UR - http://www.scopus.com/inward/record.url?scp=84901831279&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84901831279&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2014.03.060

DO - 10.1016/j.ins.2014.03.060

M3 - Article

VL - 278

SP - 380

EP - 407

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -