skip to main content
10.1145/500956.501017acmconferencesArticle/Chapter ViewAbstractPublication PagesuccsConference Proceedingsconference-collections
Article

Streamlining the recruitment process in a state university

Published:17 October 2001Publication History

ABSTRACT

The standard state-legislated hiring process used at many universities has meant multiple points of delay and frustration as units searched for key information technology professionals and lost many well-qualified candidates due to the length of the process. At the University of Maryland, the Office of Information Technology (OIT) began a dialogue with key administrators and, together, a new streamlined recruitment process was designed and piloted in FY2001. Major points of change include the ability to do general recruitment advertising as well as advertising for specific positions; to accept applicants on an ongoing basis regardless of matching position availability; to have standing recruitment teams to process applications weekly; to allow managers to move quickly and directly to hire qualified candidates. The pilot process facilitates active and timely communication with applicants as to their status in our application pool. The pilot also permits the referral of applicants to other units within OIT and within the university. Paperwork jams external to the process still exist for completing hires and the staff time committed to the program is substantial. Experimental use of WebCT for online application review is being tried by one of the four standing recruitment teams. Some elements of the original negotiation of the pilot program have not been implemented, including a special career track for outstanding students.

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Conferences
    SIGUCCS '01: Proceedings of the 29th annual ACM SIGUCCS conference on User services
    October 2001
    300 pages
    ISBN:1581133820
    DOI:10.1145/500956

    Copyright © 2001 ACM

    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 17 October 2001

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • Article

    Acceptance Rates

    Overall Acceptance Rate123of170submissions,72%
  • Article Metrics

    • Downloads (Last 12 months)8
    • Downloads (Last 6 weeks)2

    Other Metrics

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader