A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine
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.
KeywordsBicriteria Single machine scheduling Convex resource allocation Maximal lateness
Unable to display preview. Download preview PDF.
- Daniels, R. L., & Sarin, R. K. (1989). Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research, 37(6), 981–984. Google Scholar
- Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness. Management Sciences Research Project, Research Report 43, UCLA. Google Scholar
- Janiak, A. (1987). One-machine scheduling with allocation of continuously-divisible resource and with no precedence constraints. Kybernetika, 23(4), 289–293. Google Scholar
- Karush, W. (1939). Minima of functions of several variables with inequalities as side conditions. MS thesis, Department of Mathematics, University of Chicago. Google Scholar
- Kuhn, H. W., & Tucker, A. W. (1951). Nonlinear programming. In Proceedings of the second symposium (pp. 481–492). Berkeley: University of California Press. Google Scholar
- Shabtay, D., & Steiner, G. (2007, in press). Single machine batch scheduling to minimize total completion time and resource consumption costs. Journal of Scheduling. Google Scholar
- Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258–262. Google Scholar