J. Jozefowska et al., Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs, DISCR APP M, 94(1-3), 1999, pp. 263-285
A class of discrete-continuous scheduling problems is considered when each
nonpreemptable, independent job simultaneously requires for its processing
a machine from a set of m identical, parallel machines and an amount, arbit
rary within interval [0,1], of a continuously divisible, renewable resource
available in amount 1. Job processing rates are described by power functio
ns of the resource amount allotted at a time. Some properties of optimal sc
hedules are proved which allow to find such schedules analytically in some
cases and to construct efficient heuristics in the general case. Results of
a computational experiment are described. (C) 1999 Elsevier Science B.V. A
ll rights reserved.