The Assignment Problem with Seniority and Job Priority Constraints

References

• Aboudi R., Nemhauser G. L. Some facets for an assignment problem with side constraints. Oper. Res. (1991) 39:244–250Link, Google Scholar
• Berge C. Two theorems in graph theory. Proc. National Acad. Sci. (1957) . USA 43842—844 1970Graphes et Hypergraphes. Dunod, ParisGoogle Scholar
• Bertsekas D. P.Linear Network Optimization (1991) (MIT Press, Cambridge MA) Google Scholar
• Kuhn H. W. The Hungarian method for the assignment problem. Naval Res. Logist. Quart. (1955) 2:83–97Crossref, Google Scholar
• Goldfarb D. Efficient dual simplex algorithms for the assignment problem. Math. Programming (1985) 33:187–203Crossref, Google Scholar
• Jonker R., Volgenant A. A shortest augmenting path algorithm for dense and sparse assignment problem. Computing (1987) 38:325–340Crossref, Google Scholar
• Mazzola J., Neebe A. W. Resource-constrained assignment scheduling. Oper. Res. (1986) 34:560–572Link, Google Scholar