INTEGER LINEAR PROGRAMMING ON PREFERENCE MAXIMIZED OF WORKFORCE SCHEDULING

  • Siti Noor Asyikinbintimohd Razali
  • Looi Mei Fen
  • Norazman Arbin
  • Azme Khamis
Keywords: Workforce scheduling problem, integer linear programming, optimization problem

Abstract

This study investigated the application of integer linear programming with the purpose of solving workforce scheduling problems in real life and satisfying the constraints at the same time, which includes the staff preferences towards shift and company policies. Integer linear programming is a well-known mathematical approach which is able to obtain the optimal solution faster than manually schedule construction in a less-complex way. In this study, a weekly schedule which involved thirteen staff is obtained successfully by using integer linear programming approach through the help of LP Solve IDE software. The result showed that the total staffing cost was successfully minimized due to reduced number of full shift assigned to staff. In addition, the staff satisfaction is maximized by satisfying all their preferences.

Downloads

Download data is not yet available.

References

Algethami, H., Pinheiro, R. L., &Landa-Silva, D. (2016). “A genetic algorithm for a workforce scheduling and routing problemâ€,2016 IEEE Congress on Evolutionary Computation (CEC). pp.927-934.

Mohsenpour, Mohammadreza, Robab Rahmati, and Mahmoud Meidani. n.d. “Comparison of the Emotional Behavioral Characteristics of Single-Parent Children Due to Divorce with Ordinary Children.†269| International Journal of Pharmaceutical Research 10 (1).

Bakır, M. A., &Aksop, C. (2008). “A 0-1 integer programming approach to a university timetabling problemâ€,Hacettepe Journal of Mathematics and Statistics. 37(1), pp.41-55.

Bruecker, P.D., Bergh, J.V, Belien, J., &Demeulemeester, E. (2014). “A Tabu search heuristic for building aircraft maintenance personnel rostersâ€,SSRN Electronic Journal.

Burke, E., &Soubeiga, E. (2003). “Scheduling nurses using a tabu-search hyperheuristicâ€,Journal of Heuristics. 9(6), pp.180-197.

Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). “Nurse rostering problems––a bibliographic surveyâ€,European Journal of Operational Research. 151(3), pp.447-460.

Duka, E. (2015). “Nurse Scheduling Problemâ€,European Scientific Journal, ESJ. 11(10), pp.53-63.

Greenspan, R. (2005). “A Multi-objective Genetic Algorithm for Employee Schedulingâ€, Urbana: University of Illinois.

Hakansson, R. (2015). “Staff scheduling in elderly care-A simulation study of trade- offsâ€,Linkoping, Sweden: Linkoping University Electronic Press.

Khumaraguru, S., Satheese K.B. &Nagalakshmi G. (2014). “The Effective Use of Resources for Bus Scheduling Using Linear Programmingâ€,IJSR – International Journal of Scientific Research. 3(9), pp.505-507.

Kumar, B. S., Nagalakshmi, G., &Kumaraguru, S. (2014). “A shift sequence for nurse scheduling using linear programming problemâ€,Journal of Nursing and Health Science. 3(6), pp.24-28.

Labidi, M., Mrad, M., Gharbi, A., &Louly, M. A. (2014). “Scheduling IT Staff at a Bank: A Mathematical Programming Approachâ€,The Scientific World Journal, 2014, pp. 1-10.

Mohamad, N. H., & Said, F. (2013). “Integer Linear Programming approach to scheduling toll booth collectors problemâ€,Indian Journal of Science and Technology. 6(5), pp.4416-4421.

Pezzella, F., &Merelli, E. (2000). “A tabu search method guided by shifting bottleneck for the job shop scheduling problemâ€,European Journal of Operational Research. 120(2), pp.297-310.

Rajeevan, M., &Nagavinothini (2015). R. “Time Optimization for Resource- Constrained Project Scheduling Using Meta-heuristic Approachâ€,International Journal of Science, Engineering and technology Research (IJSETR). 4(3), pp.606-609.

Satheeshkumar, B., Nareshkumar, S., &Kumaraghuru, S. (2014). “Linear Programming Applied to Nurses Shifting Problemsâ€,International Journal of science and research. 3(3), pp.171-173.

Shinto, K. G., &Sushama, C. M. (2013). “An Algorithm for Solving Integer Linear Programming Problemsâ€,International Journal of Research in Engineering and Technology. 2(7), pp.107-112.

Thompson, G. M. (2003). “Labor scheduling: A commentaryâ€,The Cornell Hotel and Restaurant Administration Quarterly. 44(5-6), pp.149-155.

Trilling, L., Guinet, A., & Le Magny, D. (2006). “Nurse scheduling using integer linear programming and constraint programmingâ€,Elsevier Ltd: IFAC Proceedings Volumes. 39(3), pp.671-676.

Published
2018-12-03
How to Cite
Razali, S. N. A., Fen, L. M., Arbin, N., & Khamis, A. (2018). INTEGER LINEAR PROGRAMMING ON PREFERENCE MAXIMIZED OF WORKFORCE SCHEDULING. COMPUSOFT: An International Journal of Advanced Computer Technology, 7(11). Retrieved from https://ijact.in/index.php/ijact/article/view/807
Issue
Vol. 7 No. 11 (2018): Volume-7, Issue-11
Section
Articles

The submitter hereby warrants that the Work (collectively, the “Materials”) is original and that he/she is the author of the Materials. To the extent the Materials incorporate text passages, figures, data or other material from the works of others, the undersigned has obtained any necessary permissions. Where necessary, the undersigned has obtained all third party permissions and consents to grant the license above and has all copies of such permissions and consents.

The submitter represents that he/she has the power and authority to make and execute this assignment. The submitter agrees to indemnify and hold harmless the COMPUSOFT from any damage or expense that may arise in the event of a breach of any of the warranties set forth above. For authenticity, validity and originality of the research paper the author/authors will be totally responsible.