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 |
| Publication status | 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
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)