Single machine bicriteria scheduling using the apparent tardiness cost heuristic

Hari Balasubramanian; John Fowler; Michèle Pfund

Single machine bicriteria scheduling using the apparent tardiness cost heuristic

Hari Balasubramanian, John Fowler, Michèle Pfund

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English (US)
Title of host publication	2006 IIE Annual Conference and Exhibition
State	Published - 2006
Event	2006 IIE Annual Conference and Exposition - Orlando, FL, United States Duration: May 20 2006 → May 24 2006

Other

Other	2006 IIE Annual Conference and Exposition
Country/Territory	United States
City	Orlando, FL
Period	5/20/06 → 5/24/06

Keywords

Apparent tardiness cost
Bicriteria scheduling
Composite dispatching rules

ASJC Scopus subject areas

Industrial and Manufacturing Engineering

Cite this

@inproceedings{71d7e0cba0d84e32ab8f73c5ee47c453,

title = "Single machine bicriteria scheduling using the apparent tardiness cost heuristic",

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.",

keywords = "Apparent tardiness cost, Bicriteria scheduling, Composite dispatching rules",

author = "Hari Balasubramanian and John Fowler and Mich{\`e}le Pfund",

year = "2006",

language = "English (US)",

booktitle = "2006 IIE Annual Conference and Exhibition",

note = "2006 IIE Annual Conference and Exposition ; Conference date: 20-05-2006 Through 24-05-2006",

}

TY - GEN

T1 - Single machine bicriteria scheduling using the apparent tardiness cost heuristic

AU - Balasubramanian, Hari

AU - Fowler, John

AU - Pfund, Michèle

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Apparent tardiness cost

KW - Bicriteria scheduling

KW - Composite dispatching rules

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

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

M3 - Conference contribution

AN - SCOPUS:36448945840

BT - 2006 IIE Annual Conference and Exhibition

T2 - 2006 IIE Annual Conference and Exposition

Y2 - 20 May 2006 through 24 May 2006

ER -

Single machine bicriteria scheduling using the apparent tardiness cost heuristic

Abstract

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this