diff --git a/src/qsched.c b/src/qsched.c
index 4bf2173ffb8b9ead1c88d7ef5db45b3d7bd6c241..40810ca51006d6eb222bff3ded69270202b48d4f 100644
--- a/src/qsched.c
+++ b/src/qsched.c
@@ -858,10 +858,10 @@ void qsched_partition_compute_costs( struct qsched *s, idx_t *res_costs)
             res_costs[getindex(t->locks[j],s)] += t->cost;
         }
 
-        for(j = 0; j < t->nr_uses; j++)
+        /*for(j = 0; j < t->nr_uses; j++)
         {
-            res_costs[getindex(t->uses[j],s)] += t->cost;
-        }
+            res_costs[getindex(t->uses[j],s)] = t->cost;
+        }*/
     }   
 }
 
@@ -884,14 +884,14 @@ void qsched_partition_build_nodelist(struct qsched *s, idx_t *nodelist, idx_t *n
     for(i = 0; i < s->res_ranks[s->count_ranks]; i++)
     {
         //If the resources is locked (or used).
-        if(s->res[i].num_lockers > 0 || s->res[i].num_users > 0){
+        if(s->res[i].num_lockers > 0 /*|| s->res[i].num_users > 0*/){
             
             r = &s->res[i];
             //If it has a parent.
             if(r->parent != -1)
             {
                 //If the parent is locked then we don't need this.
-                if(s->res[getindex(r->parent,s)].num_lockers > 0 || s->res[getindex(r->parent,s)].num_users > 0)
+                if(s->res[getindex(r->parent,s)].num_lockers > 0 /*|| s->res[getindex(r->parent,s)].num_users > 0*/)
                 {
                     noderef[node_count] = -1;
                     continue;
@@ -901,7 +901,7 @@ void qsched_partition_build_nodelist(struct qsched *s, idx_t *nodelist, idx_t *n
                     while(r->parent != -1)
                     {
                         r = getres(r->parent, s);
-                        if(r->num_lockers > 0 || r->num_users > 0)
+                        if(r->num_lockers > 0 /*|| r->num_users > 0*/)
                         {
                             noderef[node_count] = 0;
                             break;
@@ -1048,7 +1048,7 @@ void qsched_partition_build_edgelist(struct qsched *s, idx_t **edge_vwgts, idx_t
                     }/* If edge doesn't exist. */
                 }
             }/* k */
-//#ifdef NO_COMPILE
+#ifdef NO_COMPILE
             for(k = 0; k < t->nr_uses; k++)
             {
                 struct res *r4 = &s->res[getindex(t->uses[k], s)];
@@ -1131,7 +1131,7 @@ void qsched_partition_build_edgelist(struct qsched *s, idx_t **edge_vwgts, idx_t
                     }/* If edge doesn't exist. */
                 }
             }/* k */
-//#endif
+#endif
         }/* j */
     }/* i */
 }