9783659828225

Nurse Scheduling Problem

Erjon Duka
This Group Deal is closed
Price
35.90 €
32.31 €

Group Deal not yet accepted

1 more copies required

ISBN-13:

978-3-659-82822-5

ISBN-10:
365982822X
EAN:
9783659828225
Book language:
English
Blurb/Shorttext:
This project aims to apply learning of operations research and optimizing resources to practical cases. The aim of this problem is to maximize the the fairness of the schedule , while respecting all the constraints . In regards with the results obtained after some tests ILP has found a very good solution to our problem . Better values of the penalties associated to the shifts could be defined in order to represent the reality more accurately especially by taking into account the length of the shifts. The models can also be solved by means of optimization software. As shown in this paper, the current schedules can benefit from this work. My problem is NP-hard that it means unsolvable.My objective is to do the objective values ( diff =0.1) . The ideal must be 0 but it is impossible.there is shown in the table in 5 shifts , 20 nurses 10 weeks. We see that when we increase the number of shift the objective value is decreasing. It is fact that when we add a shift the software must do more iterations but the penalty is decreasing. We see that with the same number of iterations the penalty is smaller when we add a shift.
Publishing house:
LAP LAMBERT Academic Publishing
Website:
https://www.lap-publishing.com/
By (author) :
Erjon Duka
Number of pages:
80
Published on:
2016-01-27
Stock:
Available
Category:
Mathematics
Price:
35.90 €
Keywords:
Linear programming, integer programming scheduling

Newsletter

Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay Paypal Wire Transfer

  0 products in the shopping cart
Edit cart
Loading frontend
LOADING