##
**A note on the scheduling with two families of jobs.**
*(English)*
Zbl 1123.90040

Summary: K. R. Baker and J. C. Smith [J. Sched. 6, No. 1, 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(n_1 n_2 (n_1 + n_2))\) time algorithm.

### MSC:

90B35 | Deterministic scheduling theory in operations research |

90C60 | Abstract computational complexity for mathematical programming problems |

Full Text:
DOI

### References:

[1] | Baker, K. R. and J. C. Smith, ”A multiple-criterion model for machine scheduling,” Journal of Scheduling, 6, 7–16, (2003). · Zbl 1154.90406 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.