Assignment problem with seniority and job priority constraints

Operations Research

Volumn 47, Issue 3, 1999, Pages 449-453

  Caron, Gaétan ^a   Hansen, Pierri ^b   Jaumard, Brigitte ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

^b HEC MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; HEURISTIC METHODS; OPTIMIZATION; PROCESS CONTROL; SCHEDULING;

JOB PRIORITY CONSTRAINTS;

PRODUCTION CONTROL;

EID: 0032633864     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.47.3.449     Document Type: Article

References (7)

1. Aboudi, R., G. L. Nemhauser. 1991. Some facets for an assignment problem with side constraints. Oper. Res. 39 244-250.
2. Berge, C. 1957. Two theorems in graph theory. Proc. National Acad. of Sciences, USA 43 842-844. 1970. Graphes et Hypergraphes. Dunod, Paris.
3. Bertsekas, D. P. 1991. Linear Network Optimization. MIT Press, Cambridge MA.
4. Kuhn, H. W. 1955. The Hungarian method for the assignment problem. Naval Res. Logistics Quart. 2 83-97.
5. Goldfarb, D. 1985. Efficient dual simplex algorithms for the assignment problem. Math. Programming 33 187-203.
6. Jonker, R., A. Volgenant. 1987. A shortest augmenting path algorithm for dense and sparse assignment problem. Computing 38 325-340.
7. Mazzola, J., A. W. Neebe. 1986. Resource-constrained assignment scheduling. Oper. Res. 34 560-572.