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

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

Research output: Contribution to journalArticle

33 Scopus citations

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
DOIs
StatePublished - Sep 1998
Externally publishedYes

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'A genetic algorithm for scheduling job families on a single machine with arbitrary earliness/tardiness penalties and an unrestricted common due date'. Together they form a unique fingerprint.

  • Cite this