Workload coverage through nonsmooth optimization
journal contribution
posted on 2009-04-01, 00:00 authored by N Sukhorukova, Julien UgonJulien Ugon, John YearwoodJohn YearwoodIn this paper, workload coverage is the problem of identifying a pattern of days worked and days off, along with the number of hours worked on each work day. This pattern must satisfy certain work-related constraints and fit best to a predefined workload. In our study, we formulate the problem of workload coverage as an optimization problem. We propose a number of models which take into consideration various staffing constraints. For each of these models, our study aims to find a compromise between an accurate workload coverage and the ability to solve the corresponding optimization problems in a reasonable time. Numerical experiments on each model are carried out and the results are presented. Interestingly, the nonlinear programming approaches are found to be competitive with linear programming ones. © 2009 Taylor & Francis.
History
Journal
Optimization Methods and SoftwareVolume
24Pagination
285-298Publisher DOI
ISSN
1055-6788eISSN
1029-4937Publication classification
CN.1 Other journal articleCopyright notice
Taylor and Francis, 2009Issue
2Publisher
Taylor and FrancisUsage metrics
Categories
Keywords
Licence
Exports
RefWorksRefWorks
BibTeXBibTeX
Ref. managerRef. manager
EndnoteEndnote
DataCiteDataCite
NLMNLM
DCDC