Daniela I. Borissova and Ivan C. Mustakerov
An Algorithm for an Optimal Staffing Problem in Open Shop Environment
856 - 860
2013
7
4
International Journal of Economics and Management Engineering
https://publications.waset.org/pdf/1149
https://publications.waset.org/vol/76
World Academy of Science, Engineering and Technology
The paper addresses a problem of optimal staffing in
open shop environment. The problem is to determine the optimal
number of operators serving a given number of machines to fulfill the
number of independent operations while minimizing staff idle. Using
a Gantt chart presentation of the problem it is modeled as twodimensional
cutting stock problem. A mixedinteger programming
model is used to get minimal job processing time (makespan) for
fixed number of machines&039; operators. An algorithm for optimal openshop
staffing is developed based on iterative solving of the
formulated optimization task. The execution of the developed
algorithm provides optimal number of machines&039; operators in the
sense of minimum staff idle and optimal makespan for that number of
operators. The proposed algorithm is tested numerically for a real life
staffing problem. The testing results show the practical applicability
for similar open shop staffing problems.
Open Science Index 76, 2013