Personnel assignment problem with hierarchical ordering constraints

Computers and Industrial Engineering

Volumn 45, Issue 3, 2003, Pages 493-510

  Toroslu, Ismail H ^a  

^a MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Approximation; Assignment problem; Bipartite graph matching; Heuristics; Hierarchical ordering; NP complete

Indexed keywords

HEURISTIC METHODS; PERSONNEL;

PERSONNEL ASSIGNMENT PROBLEM;

GRAPH THEORY;

EID: 0141621043     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0360-8352(03)00045-7     Document Type: Article

References (9)

1. Dinç, K. & Oǧuztüzün, H (1998). Personnel assignment for Turkish Land Forces (in Turkish). In Bilişim 98, TBD 15th National Informatics Congress, Istanbul (pp. 303-307).
2. Edmonds J. Maximum matching and a polyhedron with (0,1) vertices. J. Res. Nat. Bur. Standards Sect. B. 8:1965;125-130.
3. Galil Z. Efficient algorithms for finding maximum matching in graphs. ACM Comp. Surv. 18:1986;23-38.
4. Garey M.R., Johnson D.S. Computers and Intractability: a Guide to the Theory of NP-completeness. 1979;Freemen, San Francisco, CA.
5. Hu T.C. Parallel sequencing and assembly line problems. Operations Res. 9:1961;841-848.
6. Kuhn H.W. The Hungarian method for the assignment problem. Naval Res. Logistics Q. 2:1955;83-97.
7. Liu Z., Sanlaville E. Profile scheduling by list algorithms. Chretienne P., Coffman E.G., Lenstra J.K., Liu Z. Scheduling Theory and its Applications. 1995;Wiley, New York.
8. Munkres J. Algorithms for assignment and transportation problems. J. Soc. Ind. Appl. Math. 5:1957;32-38.
9. Oguztuzun, H., Toroslu, I. H., & Iskender, C (1999). On the assignment problem under ordering constraint, ISCIS99, Kusadasi, 1999 (pp. 273-279).