A hybrid genetic algorithm with two-stage dispatching heuristic for a machine scheduling problem with step-deteriorating jobs and rate-modifying activities

Byung Do Chung, Byung Soo Kim

Research output: Contribution to journalArticle

14 Citations (Scopus)

Abstract

This article is concerned with a single machine scheduling problems that integrate by step-deterioration along with multiple rate-modifying activities (RMAs). The actual processing time of a job is defined by a step function of its starting time and a specific deterioration threshold. The starting rate of the actual processing time of jobs is restored through the application of RMAs, which recover the original processing time. In this scheduling environment, we simultaneously determine the schedule of step-deteriorating jobs and the number and positions of RMAs to minimize the makespan. We derive a mixed integer programming model to obtain the optimal solution and propose a hybrid genetic algorithm with a two-stage dispatching heuristic represented by a simple chromosome. The performance of the proposed genetic algorithm (GA) is compared with GAs with two types of chromosome representations using randomly generated test instances.

Original languageEnglish
Pages (from-to)113-124
Number of pages12
JournalComputers and Industrial Engineering
Volume98
DOIs
Publication statusPublished - 2016 Aug 1

Fingerprint

Genetic algorithms
Scheduling
Chromosomes
Deterioration
Processing
Integer programming

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Cite this

@article{4d45eda6f4fb4cbeadbf4c19a5844e79,
title = "A hybrid genetic algorithm with two-stage dispatching heuristic for a machine scheduling problem with step-deteriorating jobs and rate-modifying activities",
abstract = "This article is concerned with a single machine scheduling problems that integrate by step-deterioration along with multiple rate-modifying activities (RMAs). The actual processing time of a job is defined by a step function of its starting time and a specific deterioration threshold. The starting rate of the actual processing time of jobs is restored through the application of RMAs, which recover the original processing time. In this scheduling environment, we simultaneously determine the schedule of step-deteriorating jobs and the number and positions of RMAs to minimize the makespan. We derive a mixed integer programming model to obtain the optimal solution and propose a hybrid genetic algorithm with a two-stage dispatching heuristic represented by a simple chromosome. The performance of the proposed genetic algorithm (GA) is compared with GAs with two types of chromosome representations using randomly generated test instances.",
author = "Chung, {Byung Do} and Kim, {Byung Soo}",
year = "2016",
month = "8",
day = "1",
doi = "10.1016/j.cie.2016.05.028",
language = "English",
volume = "98",
pages = "113--124",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - A hybrid genetic algorithm with two-stage dispatching heuristic for a machine scheduling problem with step-deteriorating jobs and rate-modifying activities

AU - Chung, Byung Do

AU - Kim, Byung Soo

PY - 2016/8/1

Y1 - 2016/8/1

N2 - This article is concerned with a single machine scheduling problems that integrate by step-deterioration along with multiple rate-modifying activities (RMAs). The actual processing time of a job is defined by a step function of its starting time and a specific deterioration threshold. The starting rate of the actual processing time of jobs is restored through the application of RMAs, which recover the original processing time. In this scheduling environment, we simultaneously determine the schedule of step-deteriorating jobs and the number and positions of RMAs to minimize the makespan. We derive a mixed integer programming model to obtain the optimal solution and propose a hybrid genetic algorithm with a two-stage dispatching heuristic represented by a simple chromosome. The performance of the proposed genetic algorithm (GA) is compared with GAs with two types of chromosome representations using randomly generated test instances.

AB - This article is concerned with a single machine scheduling problems that integrate by step-deterioration along with multiple rate-modifying activities (RMAs). The actual processing time of a job is defined by a step function of its starting time and a specific deterioration threshold. The starting rate of the actual processing time of jobs is restored through the application of RMAs, which recover the original processing time. In this scheduling environment, we simultaneously determine the schedule of step-deteriorating jobs and the number and positions of RMAs to minimize the makespan. We derive a mixed integer programming model to obtain the optimal solution and propose a hybrid genetic algorithm with a two-stage dispatching heuristic represented by a simple chromosome. The performance of the proposed genetic algorithm (GA) is compared with GAs with two types of chromosome representations using randomly generated test instances.

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

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

U2 - 10.1016/j.cie.2016.05.028

DO - 10.1016/j.cie.2016.05.028

M3 - Article

AN - SCOPUS:84971323642

VL - 98

SP - 113

EP - 124

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -