A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine

0.00 Avg rating0 Votes
Article ID: iaor20083758
Country: United Kingdom
Volume: 10
Issue: 6
Start Page Number: 341
End Page Number: 352
Publication Date: Dec 2007
Journal: Journal of Scheduling
Authors: , ,
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.

Reviews

Required fields are marked *. Your email address will not be published.