Abstract
Disassemble scheduling in remanufacturing is an important issue in the current industrial scenario. Allocation of operators for this purpose forms a special class of manpower scheduling problem with an added layer of restrictions. In this paper we propose a set of heuristics that make use of the concept of load information utilization. Several modifications have been incorporated on the basic framework and thorough comparison has been made between the same to devise an efficient way to tackle remanufacturing scheduling problems. The developed method has been put to test on a series of test functions of varying range of difficulty. The results prove the efficiency of these heuristics to solve this scheduling problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Remanufacturing, link, http://en.wikipedia.org/wiki/Remanufacturing
The Remanufacturing institute, link, http://reman.org/AboutReman_main.htm
Remanufacturing, http://www.remanufacturing.org.uk/
Lau, H.C.: On the complexity of manufacturing shift scheduling. Computers Ops. Res. 23(1), 93–102 (1996)
Ho, S.C., Leung, J.M.Y.: Solving a manpower scheduling problem for airline catering using metaheuristics. European Journal of Operational Research 202, 903–921 (2010)
Pan, K.-Q., Suganthan, P.N.: Solving manpower scheduling problem in manufacturing using mixed-integer programming with a two-stage heuristic algorithm. Int. J. Adv. Manuf. Technol. 46, 1229–1237 (2010)
Joseph, A., Egon, B., Daniel, Z.: The Shifting Bottleneck Procedure for Job-shop Scheduling. Management Science 34(3) (March 1988) (printed in USA)
Wang, L., Zhou, G., Xu, Y., Wang, S., Liu, M.: An effective artificial bee colony algorithm for the flexible jobshop scheduling problem. The International Journal of Advanced Manufacturing Technology 60(1-4), 303–315 (2012)
Das, S., Suganthan, P.N.: Differential Evolution – A Survey of the state-of-the-art. IEEE Transactions on Evolutionary Computation 15(1), 4–31 (2011)
Pezella, F., Morganti, G., Ciaschetti, G.: A genetic algorithm for the flexible Job-shop Scheduling Problem. Computers & Operations Research 35(10), 3202–3212 (2008)
Heuristics, http://en.wikipedia.org/wiki/Heuristic
Chekuri, C., Bender, M.: An efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines. Journal of Algorithms 41(2), 212–224 (2001)
Geraldi, J., Lechter, T.: Gantt charts revisited: A critical analysis of its roots and implications to the management of projects today. International Journal of Managing Projects in Business 5(4), 578–594 (2012)
Gnatt chart link, http://en.wikipedia.org/wiki/Gantt_chart
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer International Publishing Switzerland
About this paper
Cite this paper
Debchoudhury, S., Basu, D., Gao, KZ., Suganthan, P.N. (2013). Load Information Based Priority Dependant Heuristic for Manpower Scheduling Problem in Remanufacturing. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2013. Lecture Notes in Computer Science, vol 8297. Springer, Cham. https://doi.org/10.1007/978-3-319-03753-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-03753-0_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03752-3
Online ISBN: 978-3-319-03753-0
eBook Packages: Computer ScienceComputer Science (R0)