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:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
2014
|
| 主題: | |
| 在線閱讀: | http://hdl.handle.net/10356/60522 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|