A Dynamic Programming Algorithm For DaysOff Scheduling With Sequence Dependent Labor Costs. JOURNAL OF SCHEDULING, 11. pp. 8593.

PDF (A research paper on: A Dynamic Programming Algorithm For DaysOff Scheduling With Sequence Dependent Labor Costs)
001_a_dynamic_programming_algorithm_for_days_elshafei_isi_000253698200001.pdf Download (34kB)  Preview 
Abstract
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic daysoff scheduling constraints and a cost structure that depends on the work sequence for each employee. The daysoff scheduling constraints include the following: (1) each employee is assigned no more than three workdays per week, (2) each employee is assigned at least two consecutive off days per week, and (3) any work stretch cannot exceed four consecutive workdays. The sequencedependent cost structure assumes that the daily wage of each employee depends on two factors: (1) whether the given workday is weekend or a regular workday, and (2) the sequence of work patterns assigned in previous days. A DP algorithm suited to instances of moderate size is used to determine the optimum work assignments that minimize the total labor cost, while satisfying the work demand under the stated constraints.
Item Type:  Article 

Subjects:  Systems 
Department:  College of Computing and Mathematics > lndustrial and Systems Engineering 
Depositing User:  MR. ATIQ WALIULLAH SIDDIQUI 
Date Deposited:  14 Jun 2008 13:04 
Last Modified:  01 Nov 2019 13:44 
URI:  https://eprints.kfupm.edu.sa/id/eprint/2469 