Name
Abstract | ||
|---|---|---|
This paper deals with methods for solving resource-constrained project-scheduling problems. Among the project activities there can be resource conflicts due to the finite capacity of the resources. The paper aims at describing a new method for minimizing the expected makespan while all the possible resource conflicts get eliminated. The novelty of the algorithm is that it does not enumerate all the possible conflicts in advance but only those which may occur in a partial schedule. The new method has been evaluated using benchmark problems from the literature. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1145/1839379.1839419 | International Conference on Computer Systems and Technologies |
Keywords | Field | DocType |
partial schedule,paper deal,project scheduling,maximum cut computation,combinatorial optimization,project scheduling problem,graph theorem,expected makespan,possible resource conflict,possible conflict,project activity,new method,finite capacity,algorithms,benchmark problem,resource conflict | Schedule (project management),Mathematical optimization,Job shop scheduling,Computer science,Theoretical computer science,Combinatorial optimization,Novelty,Maximum cut,Computation | Conference |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Zsolt Csuka | 1 | 0 | 0.34 |