Journal of Scheduling

, Volume 8, Issue 6, pp 537–542

A note on the scheduling with two families of jobs

Authors

    • Department of MathematicsZhengzhou University
  • W. P. Shang
    • Department of MathematicsZhengzhou University
  • Q. Feng
    • Department of MathematicsZhengzhou University
Technical Note

DOI: 10.1007/s10951-005-4997-z

Cite this article as:
Yuan, J.J., Shang, W.P. & Feng, Q. J Sched (2005) 8: 537. doi:10.1007/s10951-005-4997-z

Abstract

Baker and Smith [J. Scheduling, 6, 7–16, 2003] 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 O(n1n2(n1 + n2)) time algorithm.

Copyright information

© Springer Science + Business Media, Inc. 2005