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

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

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

1 Citation (Scopus)

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 languageEnglish (US)
Title of host publicationIIE Annual Conference and Exhibition 2004
Pages813-818
Number of pages6
StatePublished - 2004
EventIIE Annual Conference and Exhibition 2004 - Houston, TX, United States
Duration: May 15 2004May 19 2004

Other

OtherIIE Annual Conference and Exhibition 2004
CountryUnited States
CityHouston, TX
Period5/15/045/19/04

Fingerprint

Scheduling
Polynomials
Processing

Keywords

  • Heuristic
  • Scheduling
  • Tabu Search
  • Wafer fab

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Qu, P., Mason, S. J., Kutanoglu, E., & Fowler, J. (2004). A polynomial time heuristic for scheduling multiple-order jobs on a single machine. In IIE Annual Conference and Exhibition 2004 (pp. 813-818)

A polynomial time heuristic for scheduling multiple-order jobs on a single machine. / Qu, Peng; Mason, Scott J.; Kutanoglu, Erhan; Fowler, John.

IIE Annual Conference and Exhibition 2004. 2004. p. 813-818.

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

Qu, P, Mason, SJ, Kutanoglu, E & Fowler, J 2004, A polynomial time heuristic for scheduling multiple-order jobs on a single machine. in IIE Annual Conference and Exhibition 2004. pp. 813-818, IIE Annual Conference and Exhibition 2004, Houston, TX, United States, 5/15/04.
Qu P, Mason SJ, Kutanoglu E, Fowler J. A polynomial time heuristic for scheduling multiple-order jobs on a single machine. In IIE Annual Conference and Exhibition 2004. 2004. p. 813-818
Qu, Peng ; Mason, Scott J. ; Kutanoglu, Erhan ; Fowler, John. / A polynomial time heuristic for scheduling multiple-order jobs on a single machine. IIE Annual Conference and Exhibition 2004. 2004. pp. 813-818
@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",

}

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

ER -