A note on the scheduling with two families of jobs

A note on the scheduling with two families of jobs

0.00 Avg rating0 Votes
Article ID: iaor2008731
Country: United Kingdom
Volume: 8
Issue: 6
Start Page Number: 537
End Page Number: 542
Publication Date: Dec 2005
Journal: Journal of Scheduling
Authors: , ,
Keywords: programming: dynamic
Abstract:

Baker and Smith introduced a new model of scheduling in which there are two or more distinct families of jobs pursuing different objectives. Their contributions include two polynomial-time dynamic programming recursions, respectively, for the single machine scheduling with two families of jobs to minimize a positive combination of total weighted completion time, or maximum lateness, of the first family of jobs and maximum lateness of the second family of jobs. Unfortunately, these dynamic programming recursions are incorrect. In this paper, we solve the same problems by an 𝒪(n1 n2(n1 + n2)) time algorithm.

Reviews

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