Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 3 of 3
Full-Text Articles in Business
Nurse Rostering Problems: A Bibliographic Survey, Brenda Cheang, Haibing Li, Andrew Lim, Brian Rodrigues
Nurse Rostering Problems: A Bibliographic Survey, Brenda Cheang, Haibing Li, Andrew Lim, Brian Rodrigues
Research Collection Lee Kong Chian School Of Business
Hospitals need to repeatedly produce duty rosters for its nursing staff. The good scheduling of nurses has impact on the quality of health care, the recruitment of nurses, the development of budgets and other nursing functions. The nurse rostering problem (NRP) has been the subject of much study. This paper presents a brief overview, in the form of a bibliographic survey, of the many models and methodologies available to solve the NRP.
Manpower Allocation With Time Windows And Job Teaming Constraints, Xi Li, Yan Zhi Li, Andrew Lim, Brian Rodrigues
Manpower Allocation With Time Windows And Job Teaming Constraints, Xi Li, Yan Zhi Li, Andrew Lim, Brian Rodrigues
Research Collection Lee Kong Chian School Of Business
In the Manpower Allocation Problem with Time Windows and Job-Teaming Constraints (MAPTWTC), we have a set of jobs located at various locations where each job requires a team of workers. Each job has a time window and a job duration, during which everyone on the team has to be present. The job requirement is satisfied if and only if the required composite team works for long enough duration within the job's time window. The objective of the problem is find a schedule to minimize a weighted sum of the total number of workers, the total travelling distances of all workers …
A New Node Centroid Algorithm For Bandwidth Minimization, Brian Rodrigues, F. Xiao, A. Lim
A New Node Centroid Algorithm For Bandwidth Minimization, Brian Rodrigues, F. Xiao, A. Lim
Research Collection Lee Kong Chian School Of Business
We propose a Node Centroid method with Hill-Climbing to solve the well-known matrix band-width minimization problem, which is to permute rows and columns of the matrix to minimize its bandwidth. Many heuristics have been developed for this NP-complete problem including the Cuthill-McKee (CM) and the Gibbs, Poole and Stockmeyer (GPS) algorithms. Recently, heuristics such as Simulated Annealing, Tabu Search and GRASP have been used, where Tabu Search and the GRASP with Path Relinking have achieved significantly better solution quality than the CM and GPS algorithms. Experimentation shows that the Node Centroid method achieves the best solution quality when compared with …