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...
保存先:
第一著者: | Wee, Sze Ming |
---|---|
フォーマット: | Final Year Project Report |
言語: | English |
出版事項: |
Universiti Malaysia Sarawak, (UNIMAS)
2023
|
主題: | |
オンライン・アクセス: | http://ir.unimas.my/id/eprint/44119/3/Wee%20Sze%20Ming%20%28fulltext%29.pdf http://ir.unimas.my/id/eprint/44119/ |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
類似資料
-
Heuristic method for optimum shift scheduling design
著者:: Lee, Kong Weng, 等
出版事項: (2017) -
Enhanced evolutionary algorithm with cuckoo search for nurse scheduling and rescheduling problem
著者:: Lim, Huai Tein
出版事項: (2015) -
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
著者:: Anwar, Khairul
出版事項: (2018) -
An efficient robust hyper-heuristic algorithm to clustering problem
著者:: Bonab, M. B., 等
出版事項: (2019) -
Performance comparison of heuristic algorithms for task scheduling in IaaS cloud computing environment
著者:: Madni, S. H. H., 等
出版事項: (2017)