Informatica logo


Login Register

  1. Home
  2. Issues
  3. Volume 18, Issue 3 (2007)
  4. Multiple Shift Scheduling of Hierarchica ...

Informatica

Information Submit your article For Referees Help ATTENTION!
  • Article info
  • Related articles
  • Cited by
  • More
    Article info Related articles Cited by

Multiple Shift Scheduling of Hierarchical Workforce with Multiple Work Centers
Volume 18, Issue 3 (2007), pp. 325–342
Salem M. Al-Yakoob   Hanif D. Sherali  

Authors

 
Placeholder
https://doi.org/10.15388/Informatica.2007.180
Pub. online: 1 January 2007      Type: Research Article     

This work was supported by Kuwait University under Research Grant No. [SM06/02] and by the National Science Foundation under Research Grant No. [DMI-0094462]. Special thanks to Mrs. Fatima Al-awadi for her contributions to the computational implementation of the scheduling algorithm.

Published
1 January 2007

Abstract

This paper is concerned with an employee scheduling problem involving multiple shifts and work centers, where employees belong to a hierarchy of categories having downward substitutability. An employee at a higher category may perform the duties of an employee at a lower category, but not vice versa. However, a higher category employee receives a higher compensation than a lower category employee. For a given work center, the demand for each category during a given shift is fixed for the weekdays, and may differ from that on weekends. Two objectives need to be achieved: The first is to find a minimum-cost workforce mix of categories of employees that is needed to satisfy specified demand requirements, and the second is to assign the selected employees to shifts and work centers taking into consideration their preferences for shifts, work centers, and off-days. A mixed-integer programming model is initially developed for the problem, based on which a specialized scheduling heuristic is subsequently developed for the problem. Computational results reported reveal that the proposed heuristic determines solutions proven to lie within 92–99% of optimality for a number of realistic test problems.

Related articles Cited by PDF XML
Related articles Cited by PDF XML

Copyright
No copyright data available.

Keywords
employee scheduling manpower scheduling mixed-integer programming hierarchical workforce scheduling algorithm

Metrics
since January 2020
879

Article info
views

0

Full article
views

610

PDF
downloads

197

XML
downloads

Export citation

Copy and paste formatted citation
Placeholder

Download citation in file


Share


RSS

INFORMATICA

  • Online ISSN: 1822-8844
  • Print ISSN: 0868-4952
  • Copyright © 2023 Vilnius University

About

  • About journal

For contributors

  • OA Policy
  • Submit your article
  • Instructions for Referees
    •  

    •  

Contact us

  • Institute of Data Science and Digital Technologies
  • Vilnius University

    Akademijos St. 4

    08412 Vilnius, Lithuania

    Phone: (+370 5) 2109 338

    E-mail: informatica@mii.vu.lt

    https://informatica.vu.lt/journal/INFORMATICA
Powered by PubliMill  •  Privacy policy