A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
- First Online:
- Cite this article as:
- Yedidsion, L., Shabtay, D. & Kaspi, M. J Sched (2007) 10: 341. doi:10.1007/s10951-007-0044-6
- 96 Downloads
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.