Optimized preference of security staff scheduling using integer linear programming approach

Authors

  • Ang SY Department of Mathematics and Statistics, Faculty of Applied Sciences and Technology, Universiti Tun Hussein Onn Malaysia, Pagoh Education Hub, 84600 Pagoh, Johor, Malaysia
  • Mohd Razali SNA Department of Mathematics and Statistics, Faculty of Applied Sciences and Technology, Universiti Tun Hussein Onn Malaysia, Pagoh Education Hub, 84600 Pagoh, Johor, Malaysia
  • Kek SL Department of Mathematics and Statistics, Faculty of Applied Sciences and Technology, Universiti Tun Hussein Onn Malaysia, Pagoh Education Hub, 84600 Pagoh, Johor, Malaysia

Keywords:

scheduling, shift, preference, integer programming, security staff

Abstract

This paper proposes an optimized schedule for security staff using integer linear programming approach. It is important to improve the life quality of the security staff since the negative social life such as family problems, less social support or even stress following from a poor work schedule. Therefore, this study aims to maximize the preference satisfaction of the security staff by allowing them to choose their preferred shift and day off while taking into consideration the restrictions of the university rules. The mathematical model of integer linear programming approach is developed and solved by using LPSolve IDE package. The result shows the overall preference satisfaction of the security staff towards work shift and days off is successfully maximized from 228.33 to 394.33. The comparison of the real schedule and the new proposed optimized schedule is made and all the constraints are successfully satisfied. The proposed schedule will be able to assist the university management in producing the most flexible and beneficial schedule for their staff to increase the satisfaction towards the working life.

References

Ernst, A.T., Jiang, H., Krishnamoorthy, M., Owens, B., & Sier, D. (2004). An annotated bibliography of personnel scheduling and rostering. Annals of Operations Research, 127(1-4), 21.

Meisels, A. & Schaerf, A. (2003) Modelling and solving employee timetabling problems. Annals of Mathematics and Artificial Intelligence, 39(1-2), 41-59.

Pinedo, M.L. (2005). Planning and Scheduling in Manufacturing and Services. Edition 1. Springer-Verlag New York, NY: Springer Series

in operation research & financial engineering.

Nanda, R & Browne, J. (1992). Introduction to Employee Scheduling. New York: Van Nostrand Reinhold.

Lin CC., Kang JR., Liu WY. (2015) A Mathematical Model for Nurse Scheduling with Different Preference Ranks. In: Park J., Pan Y., Kim C., Yang Y. (eds) Future Information Technology - II. Lecture Notes in Electrical Engineering, vol 329. Springer, Dordrecht.

Ahasan, R., Khaleque, A. & Mohiuddin, G. (1999). Human aspects of shift work in developing countries: A case study in Bangladesh. Journal of Human Ergology, 28(1-2), 59-65.

Elizabeth A. Larson & Ruth Zemke (2003) Shaping the Temporal Patterns of our Lives: The Social Coordination of, Journal of Occupational Science, 10:2, 80-89, DOI:10.1080/14427591.2003.9686514.

Topaloglu, S. & Selim, H. (2010). Nurse scheduling using fuzzy modeling approach. Fuzzy Sets and Systems, 161, 1543-1563.

Ajay, K.A. (2013). Modelistic Solution Approach For Flowshop Scheduling Problems On Makespan Criterion By Heuristics Models. Manav Bharti University, Solan, India.

Schaerf, A. (1999). A survey of automated timetabling (Review of the Artificial Intelligence Review a survey of automated timetabling). Artificial Intelligence Review, 13, 87-127.

Carter, M.W. & Laporte, G. (1996) Recent developments in practical examination timetabling. In: Burke E., Ross P. (eds) Practice and

Theory of Automated Timetabling. PATAT 1995. Lecture Notes in Computer Science, 1153. Springer, Berlin, Heidelberg.

Downloads

Published

2024-02-26

How to Cite

Ang, S. Y., Mohd Razali, S. N. A., & Kek, S. L. (2024). Optimized preference of security staff scheduling using integer linear programming approach. COMPUSOFT: An International Journal of Advanced Computer Technology, 8(03), 3103–3111. Retrieved from https://ijact.in/index.php/j/article/view/488

Issue

Section

Original Research Article

Similar Articles

<< < 8 9 10 11 12 13 14 > >> 

You may also start an advanced similarity search for this article.