• RMIT Australia
  • RMIT Global
  • RMIT Australia
  • RMIT Europe
  • RMIT Vietnam

• Students
• Alumni
• Staff

Research Repository

Back to Library

• Home
• Browse
• Search
• FAQs
• About
• Contact Us

Algorithms for large scale shift minimisation personnel task scheduling problems Krishnamoorthy, M, Ernst, A and Baatar, D 2012, 'Algorithms for large scale shift minimisation personnel task scheduling problems', European Journal of Operational Research, vol. 219, no. 1, pp. 34-48. Document type: Journal Article Collection: Journal Articles Title Algorithms for large scale shift minimisation personnel task scheduling problems Author(s) Krishnamoorthy, M Ernst, A Baatar, D Year 2012 Journal name European Journal of Operational Research Volume number 219 Issue number 1 Start page 34 End page 48 Total pages 15 Publisher Elsevier Science Abstract In this paper we introduce the Personnel Task Scheduling Problem (FTSP) and provide solution algorithms for a variant of this problem known as the Shift Minimisation Personnel Task Scheduling Problem (SMPTSP). The PTSP is a problem in which a set of tasks with fixed start and finish times have to be allocated to a heterogenous workforce. Personnel work in shifts with fixed start and end times and have skills that enable them to perform some, but not all tasks. In other words, some personnel are qualified to only perform a subset of all tasks. The objective is to minimise the overall cost of personnel required to perform the given set of tasks. In this paper we introduce a special case in which the only cost incurred is due to the number of personnel (shifts) that are used. This variant of the PTSP is referred to as the Shift Minimisation Personnel Task Scheduling Problem (SMPTSP). While our motivation is a real-life Personnel Task Scheduling Problem, the formulation may also be applied to machine shop scheduling. We review the existing literature, provide mathematical formulations, and develop a heuristic approach for the SMPTSP. Subject Applied Mathematics not elsewhere classified Keyword(s) Scheduling lagrangean relaxation task scheduling machine scheduling personnel scheduling DOI - identifier 10.1016/j.ejor.2011.11.034 Copyright notice © 2011 Elsevier B.V All rights reserved. ISSN 0377-2217 Related Links Link Description http://dx.doi.org/10.1016/j.ejor.2011.11.034 Link to Published Version   Versions Version Filter Type Fri, 16 Jan 2015, 14:35:49 EST Filtered Full Citation counts:   Cited 28 times in Thomson Reuters Web of Science Article | Citations Cited 24 times in Scopus Article | Citations Altmetric details: Access Statistics: 211 Abstract Views  -  Detailed Statistics Created: Thu, 15 Jan 2015, 13:42:00 EST by Catalyst Administrator