Cyclical Staff Scheduling Using Constraint Logic Programming

Chan, Peter; Weil, Georges

doi:10.1007/3-540-44629-x_10

Cited by 15 publications

(18 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[25]) and constraint logic programming (e.g. [29]) Recently a large amount of successful research has been carried out which has investigated meta-heuristic approaches for a variety of timetabling problems (e.g. see [22,4,10,5,23]).…”

Section: Timetabling Problemsmentioning

confidence: 99%

Case-based heuristic selection for timetabling problems

Burke

Petrović

2006

J Sched

173

View full text Add to dashboard Cite

SUMMARYThis paper presents a case-based heuristic selection approach for automated university course and exam timetabling. The method described in this paper is motivated by the goal of developing timetabling systems that are fundamentally more general than the current state of the art. Heuristics that worked well in previous similar situations are memorized in a case base and are retrieved for solving the problem in hand. Knowledge discovery techniques are employed in two distinct scenarios. Firstly, we model the problem and the problem solving situations along with specific heuristics for those problems. Secondly, we refine the case base and discard cases which prove to be non-useful in solving new problems.Experimental results are presented and analyzed. It is shown that case based reasoning can act effectively as an intelligent approach to learn which heuristics work well for particular timetabling situations. We conclude by outlining and discussing potential research issues in this critical area of knowledge discovery for different difficult timetabling problems.

show abstract

Section: Timetabling Problemsmentioning

confidence: 99%

Case-based heuristic selection for timetabling problems

Burke

Petrović

2006

J Sched

173

View full text Add to dashboard Cite

show abstract

“…Cowling et al [4] have employed a hyperheuristic approach to personnel scheduling by means of a mechanism to guide the specific heuristic optimization method used depending on the properties of the solution space being examined at a given time. Chan and Weil [8] have generated solutions to problems similar to ours using a constraint logic programming (CLP) approach implemented in CHIP. Harald Meyer auf'm Hofe [18] investigated the incorporation of fuzzy constraints and branch & bound procedures into a constraint logic approach in his generation of solutions for nurse rostering in German hospitals.…”

Section: Introductionmentioning

confidence: 96%

Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization

White

2003

Practice and Theory of Automated Timetabling IV

View full text Add to dashboard Cite

Abstract. Hospitals must be staffed 24 hours a day, seven days a week by teams of doctors having certain combinations of skills. The construction of schedules for these doctors and the medical students who work with them is known to be a difficult NP-complete problem known as personnel scheduling, employee timetabling, labour scheduling or rostering. We have constructed a program that uses a constraint logic formalism to enforce certain scheduling rules followed by a tabu search heuristic optimizing algorithm to produce a call schedule that is used at the Ottawa Hospital. This call schedule can be later changed by the chief resident to accommodate last-minute personnel changes by means of a spreadsheetbased program.

show abstract

“…A mathematical model cyclic and non-cyclic scheduling of 12 hours shift for nurses by network programming was first introduced in 1996 [1]. Then in 2001, research on cyclical staffs scheduling using constraint logic programming conducted [2].…”

Section: Introductionmentioning

confidence: 99%

Solving cyclical nurse scheduling problem using preemptive goal programming

Sundari

Mardiyati²

2017

AIP Conference Proceedings

View full text Add to dashboard Cite

Corresponding author: sri_math@sci.ui.ac.idAbstract. Nurse scheduling system in a hospital is being modeled as a preemptive goal programming problem that is solved by using LINGO software with the objective function to minimize deviation variable at each goal. The scheduling is done cyclically, so every nurse is treated fairly since they have the same work shift portion with the other nurses. By paying attention to the hospital's rules regarding nursing work shift cyclically, it can be obtained that numbers of nurse needed in every ward are 18 nurses and the numbers of scheduling periods are 18 periods where every period consists of 21 days.

show abstract

Cyclical Staff Scheduling Using Constraint Logic Programming

Cited by 15 publications

References 6 publications

Case-based heuristic selection for timetabling problems

Case-based heuristic selection for timetabling problems

Scheduling Doctors for Clinical Training Unit Rounds Using Tabu Optimization

Solving cyclical nurse scheduling problem using preemptive goal programming

Contact Info

Product

Resources

About