Advertisement

All-Terrain Tabu Search Approaches for Production Management Problems

  • Nicolas Zufferey
  • Jean Respen
  • Simon Thevenin
Chapter
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 62)

Abstract

A metaheuristic is a refined solution method able to find a satisfying solution to a difficult problem in a reasonable amount of time. A local search metaheuristic works on a single solution and tries to improve it iteratively. Tabu search is one of the most famous local search, where at each iteration, a neighbor solution is generated from the current solution by performing a specific modification (called a move) on the latter. The goal of this chapter is to present tabu search approaches with enhanced exploration and exploitation mechanisms. For this purpose, the following ingredients are discussed: different neighborhood structures (i.e., different types of moves), guided restarts based on a distance function, and deconstruction/reconstruction techniques. The resulting all-terrain tabu search approaches are illustrated for various production problems: car sequencing, job scheduling, resource allocation, and inventory management.

Keywords

Tabu search Car sequencing Job scheduling Resource allocation Inventory management 

References

  1. 1.
    C. Almeder, B. Almada-Lobo, Synchronisation of scarce resources for a parallel machine lotsizing problem. Int. J. Prod. Res. 49(24), 7315–7335 (2011)CrossRefGoogle Scholar
  2. 2.
    Rockwell Automatisation, Arena Standard Edition, Milwaukee (2000)Google Scholar
  3. 3.
    C. Becker, A. Scholl, A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 168(3), 694–715 (2006)CrossRefGoogle Scholar
  4. 4.
    I. Bloechliger, N. Zufferey, Multi-coloring and project-scheduling with incompatibility and assignment costs. Ann. Oper. Res. 211(1), 83–101 (2013)CrossRefGoogle Scholar
  5. 5.
    A. Dolgui, A. Eremeev, V. Sigaev, HBBA: hybrid algorithm for buffer allocation in tandem production lines. J. Intell. Manuf. 18(3), 411–420 (2007)CrossRefGoogle Scholar
  6. 6.
    G. Even, M.M. Halldórsson, L. Kaplan, D. Ron, Scheduling with conflicts: online and offline algorithms. J. Sched. 12(2), 199–224 (2009)CrossRefGoogle Scholar
  7. 7.
    M. Garey, D.S. Johnson, Computer and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979)Google Scholar
  8. 8.
    M. Gendreau, J.-Y. Potvin. Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146 (Springer, Berlin, 2010)Google Scholar
  9. 9.
    A. Hertz, D. Schindl, N. Zufferey, Lower bounding and tabu search procedures for the frequency assignment problem with polarization constraints. 4OR 3(2), 139–161 (2005)Google Scholar
  10. 10.
    A. Hertz, D. Schindl, N. Zufferey, A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5), 425–450 (2009)CrossRefGoogle Scholar
  11. 11.
    N. Mladenovic, P. Hansen, Variable neighborhood search. Comp. Oper. Res. 24, 1097–1100 (1997)CrossRefGoogle Scholar
  12. 12.
    J. Respen, N. Zufferey, Tabu search with guided restarts for a car production problem with a 2/3 balancing penalty, in Proceedings of the 5th International Conference on Metaheuristics and Nature Inspired Computing, Marrakech, 27–31 October 2014Google Scholar
  13. 13.
    J. Respen, N. Zufferey, E. Amaldi, Heuristics for a multi-machine multi-objective job scheduling problem with smoothing costs, in 1st IEEE International Conference on Logistics Operations Management, vol. LOM 2012, Le Havre, 17–19 October 2012Google Scholar
  14. 14.
    D. Schindl, N. Zufferey, Solution methods for fuel supply of trains. Inf. Syst. Oper. Res. 51(1), 22–29 (2013)Google Scholar
  15. 15.
    C. Shi, S.B. Gershwin, An efficient buffer design algorithm for production line profit maximization. Int. J. Prod. Econ. 122(2), 725–740 (2009)CrossRefGoogle Scholar
  16. 16.
    E.A. Silver, N. Zufferey, Inventory control of raw materials under stochastic and seasonal lead times. Int. J. Prod. Res. 43, 5161–5179 (2005)CrossRefGoogle Scholar
  17. 17.
    E.A. Silver, D.F. Pyke, R. Peterson, Inventory Management and Production Planning and Scheduling (Wiley, New York, 1998)Google Scholar
  18. 18.
    S.A. Slotnick, Order acceptance and scheduling: a taxonomy and review. Eur. J. Oper. Res. 212(1), 1–11 (2011)CrossRefGoogle Scholar
  19. 19.
    C. Solnon, V.D. Cung, A. Nguyen, C. Artigues, The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF’ 2005 challenge problem. Eur. J. Oper. Res. 191(3), 912–927 (2008)CrossRefGoogle Scholar
  20. 20.
    S. Thevenin, N. Zufferey, A deconstruction-reconstruction metaheuristic for a job scheduling problem, in Proceedings of the 5th International Conference on Metaheuristics and Nature Inspired Computing, Marrakech, 27–31 October 2014Google Scholar
  21. 21.
    S. Thevenin, N. Zufferey, J.-Y. Potvin, Multi-objective parallel machine scheduling with incompatible jobs, in Proceedings for the ROADEF 2014 Conference, Bordeaux, 26–28 February 2014Google Scholar
  22. 22.
    S. Thevenin, N. Zufferey, M. Widmer, Metaheuristics for a scheduling problem with rejection and tardiness penalties. J. Sched. 18(1), 89–105 (2015)CrossRefGoogle Scholar
  23. 23.
    N. Zufferey, Dynamic tabu search with simulation for a resource allocation problem within a production environment, in Proceedings of 4th International Conference on Metaheuristics and Nature Inspired Computing (META 2012), Sousse (2012)Google Scholar
  24. 24.
    N. Zufferey, Metaheuristics: some principles for an efficient design. Comput. Technol. Appl. 3(6), 446–462 (2012)Google Scholar
  25. 25.
    N. Zufferey, Tabu search with diversity control and simulation for an inventory management problem, in Proceedings of the 5th International Conference on Metaheuristics and Nature Inspired Computing (META 2014), Marrakech, 2014Google Scholar
  26. 26.
    N. Zufferey, Multiple neighborhood in tabu search: successful applications in operations management, in Proceedings of the 4th M-Sphere Conference, Dubrovnik, October 2015Google Scholar
  27. 27.
    N. Zufferey, F. Glover, A reconstructive evolutionary metaheuristic for the vertex coloring problem, in Proceedings of the 23rd Benelux Conference on Artificial Intelligence, Gent, 3–4 November 2011, pp. 352–357Google Scholar
  28. 28.
    N. Zufferey, M. Vasquez, A generalized consistent neighborhood search for satellite scheduling problems. RAIRO Oper. Res. 41(1), 99–121 (2015)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Geneva School of Economics and Management (GSEM)University of GenevaGenevaSwitzerland

Personalised recommendations