ScholarLens Back to search
1977•Decision SciencesRequires access

THE DETAIL SCHEDULING OF A PART‐TIME WORK FORCE: A CASE STUDY OF TELLER STAFFING

Vincent A. Mabert, Alan R. Raedels

Open publisher page 44 citations

Abstract

ABSTRACT This paper presents a comparison of two heuristic methods for assigning a part‐time work force to meet varying daily work loads. The authors use actual operating data from Purdue National Bank, Lafayette, Indiana, to make teller staffing decisions. The performance criteria for comparison of the two heuristics is the minimum number of workers employed, minimum number of interbranch transfers, and computer time necessary to attain a solution.

About this research paper

What this paper is about

ABSTRACT This paper presents a comparison of two heuristic methods for assigning a part‐time work force to meet varying daily work loads. The authors use actual operating data from Purdue National Bank, Lafayette, Indiana, to make teller staffing decisions. The performance criteria for comparison of the two heuristics is the minimum number of workers employed, minimum number of interbranch transfers, and computer time necessary to attain a solution.

Why it matters

OpenAlex reports 44 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

ABSTRACT This paper presents a comparison of two heuristic methods for assigning a part‐time work force to meet varying daily work loads. The authors use actual operating data from Purdue National Bank, Lafayette, Indiana, to make teller staffing decisions. The performance criteria for comparison of the two heuristics is the minimum number of workers employed, minimum number of interbranch transfers, and computer time necessary to attain a solution.

Key concepts: Staffing, Heuristics, Scheduling (production processes), Computer science, Operations research, Work (physics), Heuristic, Industrial engineering

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
THE DETAIL SCHEDULING OF A PART‐TIME WORK FORCE: A CASE STUDY OF TELLER STAFFING — Research Paper | ScholarLens