Robust intelligent construction procedure for job-shop scheduling

Majid Abdolrazzagh-Nezhad, Salwani Abdullah

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper proposes a robust intelligent technique to produce the initial population close to the optimal solution for the job-shop scheduling problem (JSSP). The proposed technique is designed by a new heuristic based on an intelligent skip from the primal point of the solution space to a better one that considers a new classification of jobs on machines. This new classification is named mPlates-Jobs. The main advantages of the proposed technique are its capability to produce any size of the initial population, its proximity to the optimal solution, and its capability to observe the best-known solution in the generated initial population for benchmark datasets. The comparison of the experimental results with those of Kuczapski’s, Yahyaoui’s, Moghaddam and Giffler’s, and Thompson’s initialization techniques, which are considered the four state-of-the-art initialization techniques, proves the abovementioned advantages. In this study, the proposed intelligent initialization technique can be considered a fast and intelligent heuristic algorithm to solve the JSSP based on the quality of its results.

Original languageEnglish
Pages (from-to)217-229
Number of pages13
JournalInformation Technology and Control
Volume43
Issue number3
DOIs
Publication statusPublished - 2014

Fingerprint

Heuristic algorithms
Job shop scheduling

Keywords

  • Approximation algorithms
  • Initialization procedures
  • Intelligent techniques
  • Job-shop scheduling
  • Population-based algorithms

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Control and Systems Engineering

Cite this

Robust intelligent construction procedure for job-shop scheduling. / Abdolrazzagh-Nezhad, Majid; Abdullah, Salwani.

In: Information Technology and Control, Vol. 43, No. 3, 2014, p. 217-229.

Research output: Contribution to journalArticle

@article{aed8aeab6cdd4a999bc0d61386a5d1cd,
title = "Robust intelligent construction procedure for job-shop scheduling",
abstract = "This paper proposes a robust intelligent technique to produce the initial population close to the optimal solution for the job-shop scheduling problem (JSSP). The proposed technique is designed by a new heuristic based on an intelligent skip from the primal point of the solution space to a better one that considers a new classification of jobs on machines. This new classification is named mPlates-Jobs. The main advantages of the proposed technique are its capability to produce any size of the initial population, its proximity to the optimal solution, and its capability to observe the best-known solution in the generated initial population for benchmark datasets. The comparison of the experimental results with those of Kuczapski’s, Yahyaoui’s, Moghaddam and Giffler’s, and Thompson’s initialization techniques, which are considered the four state-of-the-art initialization techniques, proves the abovementioned advantages. In this study, the proposed intelligent initialization technique can be considered a fast and intelligent heuristic algorithm to solve the JSSP based on the quality of its results.",
keywords = "Approximation algorithms, Initialization procedures, Intelligent techniques, Job-shop scheduling, Population-based algorithms",
author = "Majid Abdolrazzagh-Nezhad and Salwani Abdullah",
year = "2014",
doi = "10.5755/j01.itc.43.3.3536",
language = "English",
volume = "43",
pages = "217--229",
journal = "Information Technology and Control",
issn = "1392-124X",
publisher = "Kauno Technologijos Universitetas",
number = "3",

}

TY - JOUR

T1 - Robust intelligent construction procedure for job-shop scheduling

AU - Abdolrazzagh-Nezhad, Majid

AU - Abdullah, Salwani

PY - 2014

Y1 - 2014

N2 - This paper proposes a robust intelligent technique to produce the initial population close to the optimal solution for the job-shop scheduling problem (JSSP). The proposed technique is designed by a new heuristic based on an intelligent skip from the primal point of the solution space to a better one that considers a new classification of jobs on machines. This new classification is named mPlates-Jobs. The main advantages of the proposed technique are its capability to produce any size of the initial population, its proximity to the optimal solution, and its capability to observe the best-known solution in the generated initial population for benchmark datasets. The comparison of the experimental results with those of Kuczapski’s, Yahyaoui’s, Moghaddam and Giffler’s, and Thompson’s initialization techniques, which are considered the four state-of-the-art initialization techniques, proves the abovementioned advantages. In this study, the proposed intelligent initialization technique can be considered a fast and intelligent heuristic algorithm to solve the JSSP based on the quality of its results.

AB - This paper proposes a robust intelligent technique to produce the initial population close to the optimal solution for the job-shop scheduling problem (JSSP). The proposed technique is designed by a new heuristic based on an intelligent skip from the primal point of the solution space to a better one that considers a new classification of jobs on machines. This new classification is named mPlates-Jobs. The main advantages of the proposed technique are its capability to produce any size of the initial population, its proximity to the optimal solution, and its capability to observe the best-known solution in the generated initial population for benchmark datasets. The comparison of the experimental results with those of Kuczapski’s, Yahyaoui’s, Moghaddam and Giffler’s, and Thompson’s initialization techniques, which are considered the four state-of-the-art initialization techniques, proves the abovementioned advantages. In this study, the proposed intelligent initialization technique can be considered a fast and intelligent heuristic algorithm to solve the JSSP based on the quality of its results.

KW - Approximation algorithms

KW - Initialization procedures

KW - Intelligent techniques

KW - Job-shop scheduling

KW - Population-based algorithms

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

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

U2 - 10.5755/j01.itc.43.3.3536

DO - 10.5755/j01.itc.43.3.3536

M3 - Article

AN - SCOPUS:84907551974

VL - 43

SP - 217

EP - 229

JO - Information Technology and Control

JF - Information Technology and Control

SN - 1392-124X

IS - 3

ER -