Heuristic Algorithm For Nurse Scheduling Problem
Since the Nurse Scheduling Problem (NSP) is mostly made up of numerous restrictions and assumptions, it is referred to as the Np-Hard problem. The Nurse Scheduling Problem (NSP) deals with allocating the nurses' required shifts over a scheduling period while taking into consideration seve...
Saved in:
Main Author: | Wee, Sze Ming |
---|---|
Format: | Final Year Project Report |
Language: | English |
Published: |
Universiti Malaysia Sarawak, (UNIMAS)
2023
|
Subjects: | |
Online Access: | http://ir.unimas.my/id/eprint/44119/3/Wee%20Sze%20Ming%20%28fulltext%29.pdf http://ir.unimas.my/id/eprint/44119/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Heuristic method for optimum shift scheduling design
by: Lee, Kong Weng, et al.
Published: (2017) -
Enhanced evolutionary algorithm with cuckoo search for nurse scheduling and rescheduling problem
by: Lim, Huai Tein
Published: (2015) -
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
by: Anwar, Khairul
Published: (2018) -
An efficient robust hyper-heuristic algorithm to clustering problem
by: Bonab, M. B., et al.
Published: (2019) -
Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment
by: Madni, S. H. H., et al.
Published: (2017)