A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

Scott Webster, P. D. Jog, A. Gupta

Research output: Contribution to journalArticle

33 Citations (Scopus)

Abstract

We propose and investigate a genetic algorithm for scheduling jobs about an unrestricted common due date on a single machine. The objective is to minimize total earliness and tardiness cost where early and tardy penalty rates are allowed to be arbitrary for each job. Jobs are classified into families and a family setup time is required between jobs from two different families. Results from a computational study are promising with close to optimal solutions obtained rather easily and quickly.

Original languageEnglish (US)
Pages (from-to)2543-2551
Number of pages9
JournalInternational Journal of Production Research
Volume36
Issue number9
StatePublished - 1998
Externally publishedYes

Fingerprint

Genetic algorithms
Scheduling
Costs
Genetic algorithm
Due dates
Penalty
Tardiness
Single machine

ASJC Scopus subject areas

  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this

@article{d110cc976640430cb5b79a946b2999b6,
title = "A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date",
abstract = "We propose and investigate a genetic algorithm for scheduling jobs about an unrestricted common due date on a single machine. The objective is to minimize total earliness and tardiness cost where early and tardy penalty rates are allowed to be arbitrary for each job. Jobs are classified into families and a family setup time is required between jobs from two different families. Results from a computational study are promising with close to optimal solutions obtained rather easily and quickly.",
author = "Scott Webster and Jog, {P. D.} and A. Gupta",
year = "1998",
language = "English (US)",
volume = "36",
pages = "2543--2551",
journal = "International Journal of Production Research",
issn = "0020-7543",
publisher = "Taylor and Francis Ltd.",
number = "9",

}

TY - JOUR

T1 - A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date

AU - Webster, Scott

AU - Jog, P. D.

AU - Gupta, A.

PY - 1998

Y1 - 1998

N2 - We propose and investigate a genetic algorithm for scheduling jobs about an unrestricted common due date on a single machine. The objective is to minimize total earliness and tardiness cost where early and tardy penalty rates are allowed to be arbitrary for each job. Jobs are classified into families and a family setup time is required between jobs from two different families. Results from a computational study are promising with close to optimal solutions obtained rather easily and quickly.

AB - We propose and investigate a genetic algorithm for scheduling jobs about an unrestricted common due date on a single machine. The objective is to minimize total earliness and tardiness cost where early and tardy penalty rates are allowed to be arbitrary for each job. Jobs are classified into families and a family setup time is required between jobs from two different families. Results from a computational study are promising with close to optimal solutions obtained rather easily and quickly.

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

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

M3 - Article

AN - SCOPUS:0032165143

VL - 36

SP - 2543

EP - 2551

JO - International Journal of Production Research

JF - International Journal of Production Research

SN - 0020-7543

IS - 9

ER -