Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time

► Problem with convex resource dependent processing times is modeled and studied. ► A branch-and-bound algorithm and a heuristic algorithm were proposed. ► Experimental results show that the proposed algorithms run very efficiently.