Skip to Main Content
 

Global Search Box

 
 
 
 

ETD Abstract Container

Abstract Header

Hierarchical workforce scheduling

Hung, Rudy Ka Yiu

Abstract Details

1990, Doctor of Philosophy, Case Western Reserve University, Operations Research.
We consider a general workforce scheduling scenario in which a facility is staffed seven days a week with m types of workers. Type 1 workers are the most qualified, type 2 workers are the next most qualified, and so on. A higher qualified worker can substitute for a less qualified worker, but not vice versa. The cost per worker of type k is c k with c1 > c2 >… > c m > 0. At least D kj workers of types 1,…, k must be on duty on day j. The basic workrules are to give each worker two off-days each week and at least A out of every B weekends off. Workrule relating to workstretches will also be considered. The objective is to minimize total labor cost subject to labor requirement and workrule constraints described above. Original algorithms are given to generate optimal schedules. Potential applications can be made to many facilities, including hospitals, police and fire departments, and many manufacturing plants.
Hamilton Emmons (Advisor)
194 p.

Recommended Citations

Citations

  • Hung, R. K. Y. (1990). Hierarchical workforce scheduling [Doctoral dissertation, Case Western Reserve University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=case1054821964

    APA Style (7th edition)

  • Hung, Rudy. Hierarchical workforce scheduling. 1990. Case Western Reserve University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=case1054821964.

    MLA Style (8th edition)

  • Hung, Rudy. "Hierarchical workforce scheduling." Doctoral dissertation, Case Western Reserve University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=case1054821964

    Chicago Manual of Style (17th edition)