A polynomial time heuristic for scheduling multiple-order jobs on a single machine

Peng Qu; Scott J. Mason; Erhan Kutanoglu; John Fowler

A polynomial time heuristic for scheduling multiple-order jobs on a single machine

Peng Qu, Scott J. Mason, Erhan Kutanoglu, John Fowler

Industrial, Systems and Operations Engineering

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

1 Scopus citations

Abstract

We investigate a dispatching rule-based heuristic for the multiple orders per job scheduling problem. The heuristic is examined under single unit and single lot processing for minimizing total weighted completion time of all orders. Experimental results demonstrate the efficacy of the heuristic in an acceptable amount of computation time.

Original language	English (US)
Title of host publication	IIE Annual Conference and Exhibition 2004
Pages	813-818
Number of pages	6
State	Published - 2004
Event	IIE Annual Conference and Exhibition 2004 - Houston, TX, United States Duration: May 15 2004 → May 19 2004

Other

Other	IIE Annual Conference and Exhibition 2004
Country/Territory	United States
City	Houston, TX
Period	5/15/04 → 5/19/04

Keywords

Heuristic
Scheduling
Tabu Search
Wafer fab

ASJC Scopus subject areas

Engineering(all)

Cite this

@inproceedings{86e501e5001f46edabda998f34c4fd41,

title = "A polynomial time heuristic for scheduling multiple-order jobs on a single machine",

abstract = "We investigate a dispatching rule-based heuristic for the multiple orders per job scheduling problem. The heuristic is examined under single unit and single lot processing for minimizing total weighted completion time of all orders. Experimental results demonstrate the efficacy of the heuristic in an acceptable amount of computation time.",

keywords = "Heuristic, Scheduling, Tabu Search, Wafer fab",

author = "Peng Qu and Mason, {Scott J.} and Erhan Kutanoglu and John Fowler",

year = "2004",

language = "English (US)",

pages = "813--818",

booktitle = "IIE Annual Conference and Exhibition 2004",

note = "IIE Annual Conference and Exhibition 2004 ; Conference date: 15-05-2004 Through 19-05-2004",

}

TY - GEN

T1 - A polynomial time heuristic for scheduling multiple-order jobs on a single machine

AU - Qu, Peng

AU - Mason, Scott J.

AU - Kutanoglu, Erhan

AU - Fowler, John

PY - 2004

Y1 - 2004

N2 - We investigate a dispatching rule-based heuristic for the multiple orders per job scheduling problem. The heuristic is examined under single unit and single lot processing for minimizing total weighted completion time of all orders. Experimental results demonstrate the efficacy of the heuristic in an acceptable amount of computation time.

AB - We investigate a dispatching rule-based heuristic for the multiple orders per job scheduling problem. The heuristic is examined under single unit and single lot processing for minimizing total weighted completion time of all orders. Experimental results demonstrate the efficacy of the heuristic in an acceptable amount of computation time.

KW - Heuristic

KW - Scheduling

KW - Tabu Search

KW - Wafer fab

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

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

M3 - Conference contribution

AN - SCOPUS:30044433943

SP - 813

EP - 818

BT - IIE Annual Conference and Exhibition 2004

T2 - IIE Annual Conference and Exhibition 2004

Y2 - 15 May 2004 through 19 May 2004

ER -

A polynomial time heuristic for scheduling multiple-order jobs on a single machine

Abstract

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this