A Constraint Satisfaction Problem (CSP) Approach for the Nurse Scheduling Problem

Said, Aymen Ben; Mouhoub, Malek

doi:10.1109/ssci51031.2022.10022250

Cited by 2 publications

(1 citation statement)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to [6], to this day, no comparison has yet been made between CP modelling and the B&B algorithm, and the techniques have not been applied together. An exact alternative method to modeling and solving the Nurse Scheduling Problem (NSP) using the Constraint Satisfaction Problem (CSP) framework is proposed in [14]. The Weighted Constraint Satisfaction Problem (WCSP) was employed to capture working requirements and nurses' preferences over shift patterns.…”

Section: Literature Reviewmentioning

confidence: 99%

Makespan Minimization for the Two-Stage Hybrid Flow Shop Problem with Dedicated Machines: A Comprehensive Study of Exact and Heuristic Approaches

2023

View full text Add to dashboard Cite

This paper presents a comprehensive approach for minimizing makespan in the challenging two-stage hybrid flowshop with dedicated machines, a problem known to be strongly NP-hard. This study proposed a constraint programming approach, a novel heuristic based on a priority rule, and Tabu search procedures to tackle this optimization problem. The constraint programming model, implemented using a commercial solver, serves as the exact resolution method, while the heuristic and Tabu search explore approximate solutions simultaneously. The motivation behind this research is the need to address the complexities of scheduling problems in the context of two-stage hybrid flowshop with dedicated machines. This problem presents significant challenges due to its NP-hard nature and the need for efficient optimization techniques. The contribution of this study lies in the development of an integrated approach that combines constraint programming, a novel heuristic, and Tabu search to provide a comprehensive and efficient solution. The proposed constraint programming model offers exact resolution capabilities, while the heuristic and Tabu search provide approximate solutions, offering a balance between accuracy and efficiency. To enhance the search process, the research introduces effective elimination rules, which reduce the search space and simplify the search effort. This approach improves the overall optimization performance and contributes to finding high-quality solutions. The results demonstrate the effectiveness of the proposed approach. The heuristic approach achieves complete success in solving all instances for specific classes, showcasing its practical applicability. Furthermore, the constraint programming model exhibits exceptional efficiency, successfully solving problems with up to n=500 jobs. This efficiency is noteworthy compared to instances solved by other exact solution approaches, indicating the scalability and effectiveness of the proposed method.

show abstract

Section: Literature Reviewmentioning

confidence: 99%