Total tardiness problem with future job arrival information
We consider a single machine total tardiness problem with different release times, different due dates and available information of future job arrival in the next time period W. The goal is to generate an effective schedule for minimizing total tardiness by utilizing the future job information.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Language: | English |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10356/60522 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
Be the first to leave a comment!