The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem

References

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