A genetic algorithm for solving classical job shop scheduling problems

Abdullatif Algabasi, Alireza Maheri

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

Abstract

This paper presents a new genetic algorithm (GA) for solving job shop scheduling (JSS) problem, in which a two-dimensional chromosome is used to represent individuals. Classical JSS problem is formulated in a more realistic and general way in which the expected arrival time for each job and machine availability for each machine are also taken into account. This formulation also allows solving special cases of returning tasks, in which a job can have more than one task allocated for a specific machine. Through a case study, the performance of the developed GA in solving generalised classic JSS problem is evaluated and presented.
Original languageEnglish
Title of host publicationInternational Conference on Advances in Mechanical Engineering (ICAME'15)
Pages1-6
Number of pages6
Publication statusPublished - 1 May 2015

Fingerprint

Genetic algorithms
Chromosomes
Availability
Job shop scheduling

Keywords

  • classical job shop scheduling
  • generalised job shop scheduling
  • JSS
  • JSSP
  • genetic algorithm

Cite this

Algabasi, A., & Maheri, A. (2015). A genetic algorithm for solving classical job shop scheduling problems. In International Conference on Advances in Mechanical Engineering (ICAME'15) (pp. 1-6)

A genetic algorithm for solving classical job shop scheduling problems. / Algabasi, Abdullatif; Maheri, Alireza.

International Conference on Advances in Mechanical Engineering (ICAME'15). 2015. p. 1-6.

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

Algabasi, A & Maheri, A 2015, A genetic algorithm for solving classical job shop scheduling problems. in International Conference on Advances in Mechanical Engineering (ICAME'15). pp. 1-6.
Algabasi A, Maheri A. A genetic algorithm for solving classical job shop scheduling problems. In International Conference on Advances in Mechanical Engineering (ICAME'15). 2015. p. 1-6
Algabasi, Abdullatif ; Maheri, Alireza. / A genetic algorithm for solving classical job shop scheduling problems. International Conference on Advances in Mechanical Engineering (ICAME'15). 2015. pp. 1-6
@inproceedings{cb1d718f4efe41ee99bb5532d611fb52,
title = "A genetic algorithm for solving classical job shop scheduling problems",
abstract = "This paper presents a new genetic algorithm (GA) for solving job shop scheduling (JSS) problem, in which a two-dimensional chromosome is used to represent individuals. Classical JSS problem is formulated in a more realistic and general way in which the expected arrival time for each job and machine availability for each machine are also taken into account. This formulation also allows solving special cases of returning tasks, in which a job can have more than one task allocated for a specific machine. Through a case study, the performance of the developed GA in solving generalised classic JSS problem is evaluated and presented.",
keywords = "classical job shop scheduling, generalised job shop scheduling, JSS, JSSP, genetic algorithm",
author = "Abdullatif Algabasi and Alireza Maheri",
year = "2015",
month = "5",
day = "1",
language = "English",
pages = "1--6",
booktitle = "International Conference on Advances in Mechanical Engineering (ICAME'15)",

}

TY - GEN

T1 - A genetic algorithm for solving classical job shop scheduling problems

AU - Algabasi, Abdullatif

AU - Maheri, Alireza

PY - 2015/5/1

Y1 - 2015/5/1

N2 - This paper presents a new genetic algorithm (GA) for solving job shop scheduling (JSS) problem, in which a two-dimensional chromosome is used to represent individuals. Classical JSS problem is formulated in a more realistic and general way in which the expected arrival time for each job and machine availability for each machine are also taken into account. This formulation also allows solving special cases of returning tasks, in which a job can have more than one task allocated for a specific machine. Through a case study, the performance of the developed GA in solving generalised classic JSS problem is evaluated and presented.

AB - This paper presents a new genetic algorithm (GA) for solving job shop scheduling (JSS) problem, in which a two-dimensional chromosome is used to represent individuals. Classical JSS problem is formulated in a more realistic and general way in which the expected arrival time for each job and machine availability for each machine are also taken into account. This formulation also allows solving special cases of returning tasks, in which a job can have more than one task allocated for a specific machine. Through a case study, the performance of the developed GA in solving generalised classic JSS problem is evaluated and presented.

KW - classical job shop scheduling

KW - generalised job shop scheduling

KW - JSS

KW - JSSP

KW - genetic algorithm

M3 - Conference contribution

SP - 1

EP - 6

BT - International Conference on Advances in Mechanical Engineering (ICAME'15)

ER -