Abstract
We extend the classical single-machine maximal lateness scheduling problem to the case where the job processing times are controllable by allocating a continuous and nonrenewable resource to the processing operations. Our aim is to construct an efficient trade-off curve between maximal lateness and total resource consumption using a bicriteria approach. We present a polynomial time algorithm that constructs this trade-off curve assuming a specified general type of convex decreasing resource consumption function. We illustrate the algorithm with a numerical example.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have