Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine
D Shabtay - Computers & Operations Research, 2004 - Elsevier
Computers & Operations Research, 2004•Elsevier
In this paper we extend the classical single-machine scheduling problem with the maximal
lateness criterion to the case where the job processing times are controllable by allocating
common limited resources. For the single resource problem we determine the optimal job
sequence and resource allocation in O (n3) time, while for the two-resource problem the
optimal solution is obtained in O (n 3log (1/ε)) time, where ε is a given accuracy. For both
cases, we assume a convex resource consumption function.
lateness criterion to the case where the job processing times are controllable by allocating
common limited resources. For the single resource problem we determine the optimal job
sequence and resource allocation in O (n3) time, while for the two-resource problem the
optimal solution is obtained in O (n 3log (1/ε)) time, where ε is a given accuracy. For both
cases, we assume a convex resource consumption function.
In this paper we extend the classical single-machine scheduling problem with the maximal lateness criterion to the case where the job processing times are controllable by allocating common limited resources. For the single resource problem we determine the optimal job sequence and resource allocation in O(n3) time, while for the two-resource problem the optimal solution is obtained in O(n 3log (1/ε)) time, where ε is a given accuracy. For both cases, we assume a convex resource consumption function.
Elsevier
Showing the best result for this search. See all results