Reformulating Linear Programs with Transportation Constraints - With Applications to Workforce Scheduling

Naval Research Logistics

Volumn 51, Issue 2, 2004, Pages 275-296

  Çezik, Tolga ^a   Günlük, Oktay ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b IBM RESEARCH   (United States)

Author keywords

Linear programming; Transportation problem; Workforce scheduling

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING; SCHEDULING; SET THEORY; TRANSPORTATION;

TRANSPORTATION PROBLEMS; WORKFORCE SCHEDULING;

LINEAR PROGRAMMING;

EID: 1642343388     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/nav.10115     Document Type: Article

References (19)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network flows, Prentice Hall, Englewood Cliffs, NJ, 1993.
2. R.K. Ahuja, J.B. Orlin, C. Stein, and R.E. Tarjan, Improved algorithms for bipartite network flow, SIAM J Comput 23 (1994), 906-933.
3. AT&T Labor Contract, Agreement between AT&T corporation and communication workers of America, 1998.
4. E. Balas and W. Pulleyblank, The perfectly matchable subgraph polytope of a bipartite graph, Networks 13 (1983), 495-516.
5. S. Bechtold and L. Jacobs, Implicit optimal modeling of flexible break assignments in optimal shift scheduling, Management Sci 36 (1990), 1339-1351.
6. S. Bechtold and L. Jacobs, The equivalence of general set-covering and implicit integer programming formulations for shift scheduling, Naval Res Logist 34 (1996), 223-249.
7. W.J. Burgess and R.E. Busby, "Personnel scheduling," Handbook of industrial engineering, G. Salvendy (Editor), Wiley, New York, 1992, pp. 2155-2169.
8. T. Çezik and O. Günlük, Reformulating linear programs with transportation constraints - with applications to workforce scheduling, IBM Research Report RC22311 (W0201-093), T.J. Watson Labs, Yorktown Heights, NY, 2001.
9. T. Çezik, O. Günlük, and H. Luss, An integer programming model for the weekly tour scheduling problem, Naval Res Logist 48 (2001), 607-624.
10. B. Cook, B. Cunningham, B. Pulleyblank, and A. Schrijver, Combinatorial optimization, Wiley, New York, 1998.
11. B. Dietrich, Monge sequences, antimatroids and the transportation problem with forbidden arcs, Linear algebra and its applications 139 (1990), 133-145.
12. L.R. Ford, Jr. and D.R. Fulkerson, Flows in networks, Princeton University Press, Princeton, NJ, 1962.
13. D. Gale, A theorem on flows in networks, Pacific J Math 7 (1957), 1073-1082.
14. R. Grinold and K. Marshall, Manpower planning models, North-Holland, Amsterdam, 1977.
15. F. Glover, Maximum matching in a convex bipartite graph, Naval Res Logist Quart 14 (1967), 313-316.
16. A. Huffman, On simple linear programming problems, Convexity, Proc Symp Pure Math, American Mathematical Society, Providence, RI, 1963, Vol. 7, pp. 317-327.
17. E. Lawler, Combinatorial optimization: Networks and matroids, Holt, Rinehart and Winston, New York, 1976.
18. G.L. Nemhauser and L.A. Wolsey, Integer and combinatorial optimization, Wiley, New York, 1988.
19. G. Thompson, Improved implicit modeling of the labor shift scheduling problem, Management Sci 41 (1995), 595-607.