Heuristic method for optimum shift scheduling design

This paper describes a method to schedule shifts in the most optimum way desire for today’s cost sensitive industries.The main problem for this domain is to make sure all shifts are assigned to cover all or maximum jobs available.The shifts also need to be schedule with the least manpower possible,...

全面介紹

Saved in:
書目詳細資料
Main Authors: Lee, Kong Weng, Sze, San Nah, Phang, Keat Keong
格式: Conference or Workshop Item
語言:English
出版: 2017
主題:
在線閱讀:http://repo.uum.edu.my/22807/1/ICOCI%202017%20112-118.pdf
http://repo.uum.edu.my/22807/
http://icoci.cms.net.my/PROCEEDINGS/2017/Pdf_Version_Chap02e/PID126-112-118e.pdf
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Universiti Utara Malaysia
語言: English
實物特徵
總結:This paper describes a method to schedule shifts in the most optimum way desire for today’s cost sensitive industries.The main problem for this domain is to make sure all shifts are assigned to cover all or maximum jobs available.The shifts also need to be schedule with the least manpower possible, avoid manpower idling during the shift and take into consideration employee’s time adaptability.Our approach is to use the existing manpower prediction method to determine the minimum manpower require to complete all the jobs. Based on the minimum manpower number and shift criteria’s, the shifts are then assigned to form schedules using our proposed algorithm.The potential schedules are then optimized.Our prototype running data from airline staff shows that the method used can solve the problem efficiently even for large problem instances in seconds.