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...

Full description

Saved in:
Bibliographic Details
Main Authors: GUO, Yunsong, LIM, Andrew, RODRIGUES, Brian, YU, Shuang
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2004
Subjects:
Online Access:https://ink.library.smu.edu.sg/lkcsb_research/2565
https://doi.org/10.1016/j.cie.2004.06.004
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
Be the first to leave a comment!
You must be logged in first