Robust start for population-based algorithms solving job-shop scheduling problems

Majid Abdolrazzagh Nezhad, Salwani Abdullah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Most of the methods to solve job-shop scheduling problem (JSSP) are population-based and one of the strategies to reduce the time to reach the optimal solution is to produce an initial population that firstly has suitable distribution on space solution, secondly some of its points settle nearby to the optimal solution and lastly generate it in the shortest possible time. But since JSSP is one of the most difficult NP-complete problems and its space solution is complex, most of the previous researchers have preferred to utilize random methods or priority rules for producing initial population. In this paper, by mapping each schedule to a unique sequence of jobs on machines matrix (SJM), we have proposed the novel concept of plates, and have redefined and adapted concepts of tail and head path and have designed evaluator functions between SJM matrix and its corresponding schedule aiming at identifying gaps in the obtained schedule, we have proposed three novel initialization procedures. The proposed procedures have been run on 73 benchmark datasets and their results have been compared with some existing initialization procedures and even some approximation algorithms for solving JSSP. Based on this comparison, we have seen the proposed procedures have the significant advantage both in the quality-generated points and in the time producing them. The more interesting point in the implementation of proposed procedures on some datasets is that we see the best known solution in the produced initial population.

Original languageEnglish
Title of host publicationConference on Data Mining and Optimization
Pages219-226
Number of pages8
DOIs
Publication statusPublished - 2011
Event2011 3rd Conference on Data Mining and Optimization, DMO 2011 - Putrajaya
Duration: 28 Jun 201129 Jun 2011

Other

Other2011 3rd Conference on Data Mining and Optimization, DMO 2011
CityPutrajaya
Period28/6/1129/6/11

Fingerprint

Approximation algorithms
Computational complexity
Job shop scheduling

Keywords

  • Initial population
  • Initialization procedure
  • Job-Shop scheduling problem
  • Sequence job on machines

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Software

Cite this

Nezhad, M. A., & Abdullah, S. (2011). Robust start for population-based algorithms solving job-shop scheduling problems. In Conference on Data Mining and Optimization (pp. 219-226). [5976531] https://doi.org/10.1109/DMO.2011.5976531

Robust start for population-based algorithms solving job-shop scheduling problems. / Nezhad, Majid Abdolrazzagh; Abdullah, Salwani.

Conference on Data Mining and Optimization. 2011. p. 219-226 5976531.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nezhad, MA & Abdullah, S 2011, Robust start for population-based algorithms solving job-shop scheduling problems. in Conference on Data Mining and Optimization., 5976531, pp. 219-226, 2011 3rd Conference on Data Mining and Optimization, DMO 2011, Putrajaya, 28/6/11. https://doi.org/10.1109/DMO.2011.5976531
Nezhad, Majid Abdolrazzagh ; Abdullah, Salwani. / Robust start for population-based algorithms solving job-shop scheduling problems. Conference on Data Mining and Optimization. 2011. pp. 219-226
@inproceedings{d8cdf3bf252a4847b06eaf788c9dc58e,
title = "Robust start for population-based algorithms solving job-shop scheduling problems",
abstract = "Most of the methods to solve job-shop scheduling problem (JSSP) are population-based and one of the strategies to reduce the time to reach the optimal solution is to produce an initial population that firstly has suitable distribution on space solution, secondly some of its points settle nearby to the optimal solution and lastly generate it in the shortest possible time. But since JSSP is one of the most difficult NP-complete problems and its space solution is complex, most of the previous researchers have preferred to utilize random methods or priority rules for producing initial population. In this paper, by mapping each schedule to a unique sequence of jobs on machines matrix (SJM), we have proposed the novel concept of plates, and have redefined and adapted concepts of tail and head path and have designed evaluator functions between SJM matrix and its corresponding schedule aiming at identifying gaps in the obtained schedule, we have proposed three novel initialization procedures. The proposed procedures have been run on 73 benchmark datasets and their results have been compared with some existing initialization procedures and even some approximation algorithms for solving JSSP. Based on this comparison, we have seen the proposed procedures have the significant advantage both in the quality-generated points and in the time producing them. The more interesting point in the implementation of proposed procedures on some datasets is that we see the best known solution in the produced initial population.",
keywords = "Initial population, Initialization procedure, Job-Shop scheduling problem, Sequence job on machines",
author = "Nezhad, {Majid Abdolrazzagh} and Salwani Abdullah",
year = "2011",
doi = "10.1109/DMO.2011.5976531",
language = "English",
isbn = "9781612842127",
pages = "219--226",
booktitle = "Conference on Data Mining and Optimization",

}

TY - GEN

T1 - Robust start for population-based algorithms solving job-shop scheduling problems

AU - Nezhad, Majid Abdolrazzagh

AU - Abdullah, Salwani

PY - 2011

Y1 - 2011

N2 - Most of the methods to solve job-shop scheduling problem (JSSP) are population-based and one of the strategies to reduce the time to reach the optimal solution is to produce an initial population that firstly has suitable distribution on space solution, secondly some of its points settle nearby to the optimal solution and lastly generate it in the shortest possible time. But since JSSP is one of the most difficult NP-complete problems and its space solution is complex, most of the previous researchers have preferred to utilize random methods or priority rules for producing initial population. In this paper, by mapping each schedule to a unique sequence of jobs on machines matrix (SJM), we have proposed the novel concept of plates, and have redefined and adapted concepts of tail and head path and have designed evaluator functions between SJM matrix and its corresponding schedule aiming at identifying gaps in the obtained schedule, we have proposed three novel initialization procedures. The proposed procedures have been run on 73 benchmark datasets and their results have been compared with some existing initialization procedures and even some approximation algorithms for solving JSSP. Based on this comparison, we have seen the proposed procedures have the significant advantage both in the quality-generated points and in the time producing them. The more interesting point in the implementation of proposed procedures on some datasets is that we see the best known solution in the produced initial population.

AB - Most of the methods to solve job-shop scheduling problem (JSSP) are population-based and one of the strategies to reduce the time to reach the optimal solution is to produce an initial population that firstly has suitable distribution on space solution, secondly some of its points settle nearby to the optimal solution and lastly generate it in the shortest possible time. But since JSSP is one of the most difficult NP-complete problems and its space solution is complex, most of the previous researchers have preferred to utilize random methods or priority rules for producing initial population. In this paper, by mapping each schedule to a unique sequence of jobs on machines matrix (SJM), we have proposed the novel concept of plates, and have redefined and adapted concepts of tail and head path and have designed evaluator functions between SJM matrix and its corresponding schedule aiming at identifying gaps in the obtained schedule, we have proposed three novel initialization procedures. The proposed procedures have been run on 73 benchmark datasets and their results have been compared with some existing initialization procedures and even some approximation algorithms for solving JSSP. Based on this comparison, we have seen the proposed procedures have the significant advantage both in the quality-generated points and in the time producing them. The more interesting point in the implementation of proposed procedures on some datasets is that we see the best known solution in the produced initial population.

KW - Initial population

KW - Initialization procedure

KW - Job-Shop scheduling problem

KW - Sequence job on machines

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

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

U2 - 10.1109/DMO.2011.5976531

DO - 10.1109/DMO.2011.5976531

M3 - Conference contribution

SN - 9781612842127

SP - 219

EP - 226

BT - Conference on Data Mining and Optimization

ER -