Skip to main content

Advertisement

Log in

Metaheuristic approaches for the design of machining lines

  • Original Article
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The considered optimization problem deals with the design of the machine equipment used in a serial paced line. The cost and effectiveness of such a line depend on this decision. The investment cost can be reduced by optimizing the assignment of machining operations to the pieces of equipment. In this paper, new powerful metaheuristic methods applying the principles of a greedy randomized adaptive search procedure and a genetic algorithm are suggested for this problem. These methods are evaluated on a series of benchmarks and real industrial problems.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Andrés C, Miralles C, Pastor R (2008) Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. Eur J Oper Res 187(3):1212–1223

    Article  MATH  Google Scholar 

  2. Baykasoğlu A, Özbakır L (2007) Stochastic U-line balancing using genetic algorithms. Int J Adv Manuf Technol 32(1–2):139–147

    Article  Google Scholar 

  3. Dolgui A, Eremeev A, Guschinskaya O (2009) MIP-based GRASP and genetic algorithm for balancing transfer lines. In: Maniezzo V, Stützle T, Voß S. (eds) Matheuristics: hybridizing metaheuristics and mathematical programming. Annals of information systems, vol 10. Springer, New York. pp. 189–208

    Google Scholar 

  4. Dolgui A, Finel B, Guschinsky N, Levin G, Vernadat F (2006) MIP approach to balancing transfer lines with blocks of parallel operations. IIE Trans 38(10):869–882

    Article  Google Scholar 

  5. Dolgui A, Guschinsky N, Levin G (2006) A special case of transfer lines balancing by graph approach. Eur J Oper Res 168(3):732–746

    Article  MathSciNet  MATH  Google Scholar 

  6. Dolgui A, Guschinsky N, Levin G, Proth JM (2008) Optimisation of multi-position machines and transfer lines. Eur J Oper Res 185(3):1375–1389

    Article  MathSciNet  MATH  Google Scholar 

  7. Feo T, Resende M (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8(2):67–71

    Article  MathSciNet  MATH  Google Scholar 

  8. Festa P, Resende M (2002) GRASP: an annotated bibliography. In: Ribeiro C, Hansen P (eds) Essays and surveys on metaheuristics. Kluwer, Norwell. pp. 325–367

    Google Scholar 

  9. Glover F (1996) Tabu search and adaptive memory programming—advances, applications and challenges. In: Barr R, Helgason R, Kennington J (eds) Interfaces in computer science and operations research. Kluwer, Norwell. pp. 1–75

    Google Scholar 

  10. Guschinskaya O, Dolgui A (2009) Comparison of exact and heuristic methods for a transfer line balancing problem. Int J Prod Econ 120(2):276–286

    Article  MathSciNet  Google Scholar 

  11. Guschinskaya O, Dolgui A, Guschinsky N, Levin G (2008) A heuristic multi-start decomposition approach for optimal design of serial machining lines. Eur J Oper Res 189(3):902–913

    Article  MATH  Google Scholar 

  12. Haq A, Rengarajan K, Jayaprakash J (2006) A hybrid genetic algorithm approach to mixed-model assembly line balancing. Int J Adv Manuf Technol 28(3–4):337–341

    Google Scholar 

  13. Hart J, Shogan A (1987) Semi-greedy heuristics: an empirical study. Oper Res Lett 6(3):107–114

    Article  MathSciNet  MATH  Google Scholar 

  14. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  15. Kim Y, Song W, Kim J (2009) A mathematical model and a genetic algorithm for two-sided assembly line balancing. Comput Oper Res 36(3):853–865

    Article  MATH  Google Scholar 

  16. Laguna M, Martí R (1999) GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11(1):44–52

    Article  MATH  Google Scholar 

  17. Levitin G, Rubinovitz J, Shnits B (2006) A genetic algorithm for robotic assembly line balancing. Eur J Oper Res 168(3):811–825

    Article  MathSciNet  MATH  Google Scholar 

  18. Martino L, Pastor R (2010) Heuristic procedures for solving the general assembly line balancing problem with setups. Int J Prod Res 48(6):1787–1804

    Article  Google Scholar 

  19. McGovern S, Gupta S (2007) A balancing method and genetic algorithm for disassembly line balancing. Eur J Oper Res 179(3):692–708

    Article  MATH  Google Scholar 

  20. Reeves C (1997) Feature article—genetic algorithms for the operations researcher. INFORMS J Comput 9(3):231–250

    Article  MATH  Google Scholar 

  21. Resende M, Pitsoulis L, Pardalos P (2000) Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discrete Appl Math 100(1–2):95–113

    Article  MATH  Google Scholar 

  22. Resende M, Ribeiro C (2003) Greedy randomized adaptive search procedures. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer, Norwell. pp. 219–249

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Olga Guschinskaya.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guschinskaya, O., Gurevsky, E., Dolgui, A. et al. Metaheuristic approaches for the design of machining lines. Int J Adv Manuf Technol 55, 11–22 (2011). https://doi.org/10.1007/s00170-010-3053-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-010-3053-0

Keywords

Navigation