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 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 languageEnglish (US)
Title of host publicationIIE Annual Conference and Exhibition 2004
Pages813-818
Number of pages6
Publication statusPublished - 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

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)