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,...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2017
|
| Subjects: | |
| Online Access: | https://repo.uum.edu.my/id/eprint/22807/1/ICOCI%202017%20112-118.pdf |
| _version_ | 1803628435991429120 |
|---|---|
| author | Lee, Kong Weng Sze, San Nah Phang, Keat Keong |
| author_facet | Lee, Kong Weng Sze, San Nah Phang, Keat Keong |
| author_sort | Lee, Kong Weng |
| collection | UUM |
| description | 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. |
| first_indexed | 2024-07-04T06:21:55Z |
| format | Conference or Workshop Item |
| id | uum-22807 |
| institution | Universiti Utara Malaysia |
| language | English |
| last_indexed | 2024-07-04T06:21:55Z |
| publishDate | 2017 |
| record_format | dspace |
| spelling | uum-228072017-07-26T07:58:50Z https://repo.uum.edu.my/id/eprint/22807/ Heuristic method for optimum shift scheduling design Lee, Kong Weng Sze, San Nah Phang, Keat Keong QA75 Electronic computers. Computer science 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. 2017-04-25 Conference or Workshop Item PeerReviewed application/pdf en https://repo.uum.edu.my/id/eprint/22807/1/ICOCI%202017%20112-118.pdf Lee, Kong Weng and Sze, San Nah and Phang, Keat Keong (2017) Heuristic method for optimum shift scheduling design. In: 6th International Conference on Computing & Informatics (ICOCI2017), 25 - 27 April 2017, Kuala Lumpur. http://icoci.cms.net.my/PROCEEDINGS/2017/Pdf_Version_Chap02e/PID126-112-118e.pdf |
| spellingShingle | QA75 Electronic computers. Computer science Lee, Kong Weng Sze, San Nah Phang, Keat Keong Heuristic method for optimum shift scheduling design |
| title | Heuristic method for optimum shift scheduling design |
| title_full | Heuristic method for optimum shift scheduling design |
| title_fullStr | Heuristic method for optimum shift scheduling design |
| title_full_unstemmed | Heuristic method for optimum shift scheduling design |
| title_short | Heuristic method for optimum shift scheduling design |
| title_sort | heuristic method for optimum shift scheduling design |
| topic | QA75 Electronic computers. Computer science |
| url | https://repo.uum.edu.my/id/eprint/22807/1/ICOCI%202017%20112-118.pdf |
| work_keys_str_mv | AT leekongweng heuristicmethodforoptimumshiftschedulingdesign AT szesannah heuristicmethodforoptimumshiftschedulingdesign AT phangkeatkeong heuristicmethodforoptimumshiftschedulingdesign |