Single machine bicriteria scheduling using the apparent tardiness cost heuristic

Hari Balasubramanian, John Fowler, Michèle Pfund

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

1 Scopus citations

Abstract

In this research we investigate the possibility of using the Apparent Tardiness Cost with Ready Times (ATCR) heuristic to generate near non-dominated solutions for bicriteria single machine scheduling problems. ATCR is a composite dispatching rule with components that may be beneficial to objectives other than total weighted tardiness for which it is traditionally used. By varying the scaling parameters in ATCR rule, the possibility of generating near non-dominated solutions for bicriteria problems is explored. For comparison purposes, we use non-dominated solutions generated using a time-indexed integer programming formulation. We report results for small to medium sized problems.

Original languageEnglish (US)
Title of host publication2006 IIE Annual Conference and Exhibition
StatePublished - 2006
Event2006 IIE Annual Conference and Exposition - Orlando, FL, United States
Duration: May 20 2006May 24 2006

Other

Other2006 IIE Annual Conference and Exposition
CountryUnited States
CityOrlando, FL
Period5/20/065/24/06

Keywords

  • Apparent tardiness cost
  • Bicriteria scheduling
  • Composite dispatching rules

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'Single machine bicriteria scheduling using the apparent tardiness cost heuristic'. Together they form a unique fingerprint.

Cite this