13 citations · 31 across the 9 of their papers we have counts for
Showing 2006 · cs.DSShow all
2 papers · 2 filters
cs.DS2006
The Complexity of Mean Flow Time Scheduling Problems with Release Times
Philippe Baptiste, Peter Brucker, Marek Chrobak +3
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that whe…
cs.DS2006
Finding total unimodularity in optimization problems solved by linear programs
Christoph Durr, Mathilde Hurand
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happe…