Staffing and Allocation of Workers in An Administrative Office

The world of work is increasingly characterized by processing of records, forms, or cases. This processing is usually organized as a set of interdependent tasks within an administrative office. A major issue facing such administrative offices is how they should be organized to maximize productivity when short-term reassignment of workers is difficult, costly, or severely restricted. The present work grew out of a study conducted at a County Assistance Office in Western Pennsylvania and addresses three important productivity questions in organizational productivity: (1) How should a given number of workers be allocated across related tasks, (2) will the arrangement that seems best for productivity increase or decrease equity within the office, and (3) what is the optimal size of an office? To answer question 1, we model the administrative office as a closed queueing network. Thus modeled, the problem has an optimal allocation of workers, and we propose an efficient method for finding it. In response to question 2, we show (1) that for offices of a fixed size, the allocation of workers that maximizes throughput also maximizes equity, and (2) that across offices of different sizes, throughput per worker is not monotonicly related to equity. Changes in the size of the office that improve productivity may have lower equity; conversely, changes in the size of the office that improve equity may have lower productivity. Finally, in response to question 3, we show that the previous results can be used to determine the optimal office size in terms of throughput. This result has relevance for situations in which there are multiple offices of the same type. To the extent that worker satisfaction is related to equity, these results imply that managers may have to choose between worker satisfaction and output in setting the size of the office, but for offices of a fixed size, the allocation that maximizes output will also maximize worker satisfaction.

[1]  Vandankumar M. Trivedi,et al.  A Branch and Bound Algorithm for Optimum Allocation of Float Nurses , 1976 .

[2]  Adel Gaballa,et al.  Telephone Sales Manpower Planning at Qantas , 1979 .

[3]  John A. Buzacott,et al.  Stochastic models of manufacturing systems , 1993 .

[4]  H. Simon,et al.  Determining work loads for professional staff in a public welfare agency , 1943 .

[5]  Sidney W. Hess,et al.  A Linear Programming Approach to Production and Employment Scheduling , 1960 .

[6]  David D. Yao,et al.  On Server Allocation in Multiple Center Manufacturing Systems , 1988, Oper. Res..

[7]  Nancy Brandon Tuma,et al.  Rewards, Resources, and the Rate of Mobility: A Nonstationary Multivariate Stochastic Model , 1976 .

[8]  James S. Vandergraft A Fluid Flow Model of Networks of Queues , 1983 .

[9]  Elwood S. Buffa,et al.  AN INTEGRATED WORK SHIFT SCHEDULING SYSTEM , 1976 .

[10]  James J. Solberg,et al.  Capacity Planning with a Stochastic Workflow Model , 1981 .

[11]  Stephen S. Lavenberg,et al.  Mean-Value Analysis of Closed Multichain Queuing Networks , 1980, JACM.

[12]  I. Olkin,et al.  Inequalities: Theory of Majorization and Its Applications , 1980 .

[13]  G. C. Homans,et al.  Social Behavior: Its Elementary Forms. , 1975 .

[14]  Richard H. Bolt,et al.  Doctoral Feedback into Higher Education: An analytical model can guide the development of policies and programs , 1965 .

[15]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[16]  James A. Sullivan,et al.  DYNAMIC COURSE SCHEDULING FOR COLLEGE FACULTY VIA ZERO-ONE PROGRAMMING* , 1977 .

[17]  A. Lewin,et al.  Determining organizational effectiveness: another look, and an agenda for research , 1986 .

[18]  Richard A. Wysk,et al.  The robustness of CAN-Q in modelling automated manufacturing systems , 1986 .

[19]  J. Shanthikumar Stochastic majorization of random variables by proportional equilibrium rates , 1987 .

[20]  Rajan Suri,et al.  A Concept of Monotonicity and Its Characterization for Closed Queueing Networks , 1985, Oper. Res..

[21]  Shelby Stewman,et al.  Two Markov Models of Open System Occupational Mobility: Underlying Conceptualizations and Empirical Tests , 1975 .

[22]  David W. Conrath,et al.  The Economics of Manpower Pooling , 1971 .

[23]  Richard Valliant,et al.  COMPARISON OF SEMI‐MARKOV AND MARKOV MODELS IN A PERSONNEL FORECASTING APPLICATION , 1977 .

[24]  Elwood S. Buffa,et al.  A General Model for Production and Operations Systems , 1964 .

[25]  D. Michael Warner,et al.  Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach , 1976, Oper. Res..

[26]  P. Blau The Dynamics Of Bureaucracy , 1955 .

[27]  M. Scarlett Determining Work Loads for Professional Staff in a Public Welfare Agency , 1941 .

[28]  Richard C. Larson,et al.  OR Forum - Perspectives on Queues: Social Justice and the Psychology of Queueing , 1987, Oper. Res..

[29]  Rajan Suri,et al.  Robustness of queuing network formulas , 1983, JACM.

[30]  Joe. D. Megeath,et al.  Successful Hospital Personnel Scheduling , 1978 .