Heuristic solutions for the economic manpower shift planning problem
by Andreas C. Nearchou; Athanasios G. Lagodimos
European J. of Industrial Engineering (EJIE), Vol. 7, No. 6, 2013

Abstract: Consideration is given to the economic manpower shift planning (EMSP) problem, a capacity planning problem which seeks the workforce needed in each workday shift over a given planning horizon in order to complete a specific set of jobs at minimum cost. Since the problem has been shown to be NP-hard, we establish an optimal solution lower bound and develop heuristic algorithms for its solution. Specifically, two greedy algorithms and one meta-heuristic algorithm are developed. The meta-heuristic, which constitutes a hybrid genetic algorithm, combines the advantages of a micro-genetic algorithm (µGA) for fast solutions evolution with a variable neighbourhood search (VNS) technique for improving these solutions. Experiments over three different operating environments were performed to assess the heuristics efficiency. Comparative results from a standard integer linear programming optimiser and the lower bound proposed here show the meta-heuristic to perform very well in terms of solution quality and CPU-time requirements, particularly for large-sized problems (where it clearly outperforms both greedy algorithms). [Received 25 February 2011; Revised 24 September 2011, 15 January 2012, 13 March 2012; Accepted 26 March 2012]

Online publication date: Fri, 28-Feb-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the European J. of Industrial Engineering (EJIE):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com