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 | United States |
| City | Houston, TX |
| Period | 5/15/04 → 5/19/04 |
Fingerprint
Keywords
- Heuristic
- Scheduling
- Tabu Search
- Wafer fab
ASJC Scopus subject areas
- Engineering(all)
Cite this
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 proceeding › Conference contribution
}
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 -