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 |
---|---|
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 |
Similar Items
-
Crossdocking: JIT Scheduling with Time Windows
by: LI, Yanzhi, et al.
Published: (2004) -
Machine Scheduling Performance with Maintenance and Failure
by: GUO, Yunsong, et al.
Published: (2007) -
Two-machine Flow Shop Problems with a Single Server
by: LIM, Andrew, et al.
Published: (2006) -
Scheduling customer orders on unrelated parallel machines to minimise total weighted completion time
by: Li, Haidong, et al.
Published: (2020) -
Transshipments through Crossdocks with Inventory and Time Windows
by: LIM, Andrew, et al.
Published: (2005)