Minimizing Total Flow Time in Single Machine Environment with Release Time

We study the problem of minimizing total flow time on a single machine with job release times. This problem is NP-complete for which is no constant ratio approximation algorithm. Our objective is to study experimentally how well, on average, the problem can be solved. The algorithm we use produces n...

全面介紹

Saved in:
書目詳細資料
Main Authors: GUO, Yunsong, LIM, Andrew, RODRIGUES, Brian, YU, Shuang
格式: text
語言:English
出版: Institutional Knowledge at Singapore Management University 2004
主題:
在線閱讀:https://ink.library.smu.edu.sg/lkcsb_research/2565
https://doi.org/10.1016/j.cie.2004.06.004
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Singapore Management University
語言: English