Skip to main content
Springer Nature Link
Log in

A Novel Improved Discrete ABC Algorithm for Manpower Scheduling Problem in Remanufacturing

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8297))

Included in the following conference series:

  • 2212 Accesses

Abstract

Remanufacturing technique is a widely used approach in modern industries. But the very first step of this technique is disassembling. This disassembling operation requires an efficient employee pool and their allocation to several steps of disassembling. In this paper, we have proposed a improved ABC algorithm that can be used to solve the manpower scheduling problem for the disassembling operation in remanufacturing industry. We test this algorithm on several instances along with some existing state-of-art algorithms. The results prove the efficiency of this algorithm to solve manpower scheduling problem in remanufacturing.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
€32.70 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 42.79
Price includes VAT (France)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 52.74
Price includes VAT (France)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Remanufacturing, link: http://en.wikipedia.org/wiki/Remanufacturing

  2. The Remanufacturing institute, link: http://reman.org/AboutReman_main.htm

  3. http://www.remanufacturing.org.uk/

  4. Lau, H.C.: On the complexity of manpower scheduling. Computers Ops. Res. 23(1), 93–102 (1996)

    Article  MATH  Google Scholar 

  5. Shahrezaei, P.S., Moghaddam, R.T., Kazemipoor, H.: Solving a multi-objective multi-skilled manpower scheduling model by a fuzzy goal programming approach. Applied Mathematical Modelling 37, 5424–5443 (2013)

    Article  MathSciNet  Google Scholar 

  6. Pan, Q.K., Suganthan, P.N., Chua, T.J., Cai, T.X.: 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)

    Article  Google Scholar 

  7. Joseph, A., Egon, B., Daniel, Z.: The Shifting Bottleneck Procedure for Job-shop Scheduling. Management Science 34(3) (March 1988) (printed in USA)

    Google Scholar 

  8. Goldberg, D.E.: Genetic Algorithms in search. Addison-Wesley (1994)

    Google Scholar 

  9. 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)

    Article  MATH  Google Scholar 

  10. Karaboga, D., Basturk, B.: A powerful and Efficient Algorithm for Numerical Function Optimization: Artificial Bee Colony (ABC) Algorithm. Journal of Global Optimization 39(3), 459–471 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  11. Li, J., Pan, Q., Xie, S., Wang, S.: A hybrid artificial bee colony algorithm for flexible job shop scheduling problems. Int. J. of Computers, Communications & Control  VI(2), 286–296 (2011)

    Google Scholar 

  12. Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artificial Intelligence Review, 1–37 (2012)

    Google Scholar 

  13. Li, L., Cheng, Y., Tan, L., Niu, B.: A Discrete Artificial Bee Colony Algorithm for TSP Problem. In: Huang, D.-S., Gan, Y., Premaratne, P., Han, K. (eds.) ICIC 2011. LNCS, vol. 6840, pp. 566–573. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  14. Jacobs, L.W., Brusco, M.J.: A local search heuristic for large set-covering problems. Naval Research Logistics Quarterly 42(7), 1129–1140 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  15. Nawaz, M., Enscore Jr., E.E., Ham, I.A.: Heuristic algorithm for the m-machine, n-job flow shop sequencing problem. OMEGA 11(1), 91–95 (1983)

    Article  Google Scholar 

  16. Ruben, R., Stutzle, T.: An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives. Eur. J. Oper. Res. 187, 1143–1159 (2008)

    Article  MATH  Google Scholar 

  17. Deb, K.: An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering 186, 311–338 (2000)

    Article  MATH  Google Scholar 

  18. 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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electronics & Telecommunication Engineering, Jadavpur University, Kolkata, India

    Debabrota Basu & Shantanab Debchoudhury

  2. School of EEE, Nanyang Technological University, Singapore, 639798

    Kai-Zhou Gao & Ponnuthurai Nagaratnam Suganthan

Authors
  1. Debabrota Basu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shantanab Debchoudhury
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kai-Zhou Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ponnuthurai Nagaratnam Suganthan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Electrical Engineering Dept., IIT Delhi, Hauz Khas, 110016, New Delhi, India

    Bijaya Ketan Panigrahi

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, 639798, Singapore

    Ponnuthurai Nagaratnam Suganthan

  3. Electronics and Communication Sciences Unit, Indian Statistical Institute, 700108, Kolkata, India

    Swagatam Das

  4. SRM Engineering College, Department of Electrical and Electronics Engineering, SRM University, Potheri, Kattankulathur, Kancheepuram, 603203, Tamil Nadu, India

    Shubhransu Sekhar Dash

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Basu, D., Debchoudhury, S., Gao, KZ., Suganthan, P.N. (2013). A Novel Improved Discrete ABC Algorithm 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_65

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03753-0_65

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03752-3

  • Online ISBN: 978-3-319-03753-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation