Abstract
In the last decades job scheduling, staff rostering and staff assignment have received considerable attention, as have combinations of these problems. However, given the wide range of variants of all three basic problems, the number of combinations is immense. In this paper we introduce a new classification scheme for integrated staff rostering and job scheduling problems, extending existing schemes for project and machine scheduling. We provide some elementary reductions and show how problems studied in the literature fit into this new classification scheme. Furthermore, some complexity results are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
