The value of resource flexibility in the resource-constrained job assignment problem

Management Science

Volumn 49, Issue 6, 2003, Pages 718-732

  Vairaktarakis, George L ^a  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

Author keywords

Flexibility; Heuristics; Integer programming optimization; Resource management

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTEGER PROGRAMMING; MATRIX ALGEBRA; NUMERICAL METHODS; OPERATIONS RESEARCH; PRODUCTION;

FLEXIBILITY; RESOURCE MANAGEMENT; RESOURCE-CONSTRAINT JOB ASSIGNMENT PROBLEM;

SCHEDULING;

EID: 0038106601     PISSN: 00251909     EISSN: None     Source Type: Journal    
DOI: 10.1287/mnsc.49.6.718.16027     Document Type: Article

References (26)

1. Bailey, A.D. Jr., W.J. Boe, T. Schnack, 1974. The audit staff assignment problem: A comment. Accounting Rev. 572-574.
2. Baker K.R. 1993. Elements of Sequencing and Scheduling. Dartmouth, Hanover, NH.
3. Balachandran, B. V., A. A. Zoltners, 1981. An interactive adult-staff scheduling decision support system. Accounting Rev. 56 801-812.
4. Balachandran, K.R., R.E. Steuer, 1982. An interactive model for the CPA firm audit staff scheduling with precedence constraints and due dates. Accounting Rev. 57 125-140.
5. Chan, H., B. Dodin. 1986. A decision support system for audit staff scheduling with precedence constraints and due dates. Accounting Rev. 61(4) 726-735.
6. Cheng, T.C.E., C.C.S. Sin, 1990. A state-of-the-art review of parallel-machine scheduling research. Eur. J. Oper. Res. 47 271-292.
7. Christofides, N., R. Alvarez-Valdes, J. M. Tamarit, 1987. Project scheduling with resource constraints: A branch and bound approach. Eur. J. Oper. Res. 29 262-273.
8. Davis, E.W., J.H. Patterson. 1975. A comparison of heuristic and optimum solutions in resource-constrained project scheduling. Management Sci. 21, 944-955.
9. Demeulemeester, E., W. Herroelen. 1992 A branch-and-bound procedure for the multiple resource-constrained project scheduling problem. Management Sci. 38 1803-1818.
10. Dodin, B., H. Chan 1991. Application of production scheduling methods to external and internal audit scheduling. Eur. J. Oper. Res. 52 267-279.
11. ____, A.A. Elimam, 1997. Audit scheduling with overlapping activities and sequence-dependent setup costs. Eur. J. Oper. Res. 97 22-33.
12. Drexl, A. 1991. Scheduling of project networks by job assignment. Management Sci. 37 (12) 1590-1602.
13. Elmaghraby, S.E., J. Kamburowski. 1992. The analysis of activity networks under generalized precedence relations (GPR). Management Sci. 38(9) 1245-1263.
14. Graham, R.L. 1969. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math. 17 416-429.
15. Greeberg, H. 1968. A branch-and-bound solution to the general scheduling problem. Oper. Res. 16 353-361.
16. Kerzner, H. 1984. Project Management: A Systems Approach to Planning, Scheduling, and Controlling. Van Nostrand Reinhold, New York.
17. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys 1993. Sequencing and scheduling: Algorithms and complexity. S. C. Graves, A. H. G. Rinnooy Kan,P. Zipkin, eds. Handbooks in Operations Research and Management Science, Vol. 4. Logistics of Production and Inventory. North-Holland, New York, 445-522.
18. Lee, C.-Y., G. Vairaktarakis, 1994. Minimizing makespan in hybrid flowshops. Oper. Res. Lett. 16 149-158.
19. ____, T.C.E. Cheng, B.M.T. Lin. 1993. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Sci. 39(5) 616-625.
20. Moder, J.J., C.R. Phillips, E.W. Davis. 1983. Project Management with CPM, PERT, and Precedence Diagramming. Van Nostrand Reinhold, New York.
21. Morton, T.E., D.W. Pentico. 1993. Heuristic Scheduling Systems. John Wiley & Sons, New York.
22. Pinedo, M. 2002 Scheduling: Theory, Algorithms and Systems. Prentice-Hall, Englewood Cliffs, NJ.
23. Potts, C.N., S. V. Sevast'janov, V. A. Strusevich, L. N. Van Wassenhove, C.M. Zwaneveld, 1995. The two-stage assembly scheduling problem: Complexity and approximation. Oper. Res. 43(2) 346-355.
24. Sleator, D.D. 1980. Ph.D. dissertation, Stanford University, Stanford, CA.
25. Summers, E.L., The audit staff assignment problem: A linear programming analysis. Accounting Rev. 443-453.
26. Vairaktarakis, G., X.Q. Cai. 2003. The value of processing flexibility in multipurpose machines. IIE Trans. 35Z(8) 1-12.