Ant colony optimization for job shop scheduling

Research output: Contribution to conferencePaper

4 Citations (Scopus)

Abstract

A max-min ant colony optimization algorithm in the hyper-cube framework (MMHF) is developed to solve the jobshop scheduling problem with the objective of minimizing makespan. In MMHF, pheromone trail is limited to a fixed interval and the initial pheromone value becomes the mid-value of this interval. At every iteration, MMHF generates a schedule considering processing times along with the pheromone values. Pheromone values are iteratively adjusted through pheromone updating rules. When improved schedules cannot be generated in a given number of iterations, the pheromone trail is reinitialized with the initial pheromone value. In order to improve generated schedules by MMHF, a neighborhood search algorithm is used.

Original languageEnglish (US)
Pages1433-1438
Number of pages6
StatePublished - Dec 1 2008
EventIIE Annual Conference and Expo 2008 - Vancouver, BC, Canada
Duration: May 17 2008May 21 2008

Other

OtherIIE Annual Conference and Expo 2008
CountryCanada
CityVancouver, BC
Period5/17/085/21/08

Fingerprint

Ant colony optimization
Scheduling
Processing
Job shop scheduling

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software
  • Industrial and Manufacturing Engineering

Cite this

Seo, M., & Ventura, J. A. (2008). Ant colony optimization for job shop scheduling. 1433-1438. Paper presented at IIE Annual Conference and Expo 2008, Vancouver, BC, Canada.
Seo, Minseok ; Ventura, Jose Antonio. / Ant colony optimization for job shop scheduling. Paper presented at IIE Annual Conference and Expo 2008, Vancouver, BC, Canada.6 p.
@conference{535e77fad7a44241a9d8f76db954ef0c,
title = "Ant colony optimization for job shop scheduling",
abstract = "A max-min ant colony optimization algorithm in the hyper-cube framework (MMHF) is developed to solve the jobshop scheduling problem with the objective of minimizing makespan. In MMHF, pheromone trail is limited to a fixed interval and the initial pheromone value becomes the mid-value of this interval. At every iteration, MMHF generates a schedule considering processing times along with the pheromone values. Pheromone values are iteratively adjusted through pheromone updating rules. When improved schedules cannot be generated in a given number of iterations, the pheromone trail is reinitialized with the initial pheromone value. In order to improve generated schedules by MMHF, a neighborhood search algorithm is used.",
author = "Minseok Seo and Ventura, {Jose Antonio}",
year = "2008",
month = "12",
day = "1",
language = "English (US)",
pages = "1433--1438",
note = "IIE Annual Conference and Expo 2008 ; Conference date: 17-05-2008 Through 21-05-2008",

}

Seo, M & Ventura, JA 2008, 'Ant colony optimization for job shop scheduling', Paper presented at IIE Annual Conference and Expo 2008, Vancouver, BC, Canada, 5/17/08 - 5/21/08 pp. 1433-1438.

Ant colony optimization for job shop scheduling. / Seo, Minseok; Ventura, Jose Antonio.

2008. 1433-1438 Paper presented at IIE Annual Conference and Expo 2008, Vancouver, BC, Canada.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Ant colony optimization for job shop scheduling

AU - Seo, Minseok

AU - Ventura, Jose Antonio

PY - 2008/12/1

Y1 - 2008/12/1

N2 - A max-min ant colony optimization algorithm in the hyper-cube framework (MMHF) is developed to solve the jobshop scheduling problem with the objective of minimizing makespan. In MMHF, pheromone trail is limited to a fixed interval and the initial pheromone value becomes the mid-value of this interval. At every iteration, MMHF generates a schedule considering processing times along with the pheromone values. Pheromone values are iteratively adjusted through pheromone updating rules. When improved schedules cannot be generated in a given number of iterations, the pheromone trail is reinitialized with the initial pheromone value. In order to improve generated schedules by MMHF, a neighborhood search algorithm is used.

AB - A max-min ant colony optimization algorithm in the hyper-cube framework (MMHF) is developed to solve the jobshop scheduling problem with the objective of minimizing makespan. In MMHF, pheromone trail is limited to a fixed interval and the initial pheromone value becomes the mid-value of this interval. At every iteration, MMHF generates a schedule considering processing times along with the pheromone values. Pheromone values are iteratively adjusted through pheromone updating rules. When improved schedules cannot be generated in a given number of iterations, the pheromone trail is reinitialized with the initial pheromone value. In order to improve generated schedules by MMHF, a neighborhood search algorithm is used.

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

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

M3 - Paper

AN - SCOPUS:63849262611

SP - 1433

EP - 1438

ER -

Seo M, Ventura JA. Ant colony optimization for job shop scheduling. 2008. Paper presented at IIE Annual Conference and Expo 2008, Vancouver, BC, Canada.