NTIGen: A Software for Generating Nissan Based Instances for Time and Space Assembly Line Balancing

  • Manuel Chica SerranoEmail author
  • Óscar Cordón García
  • Sergio Damas Arroyo
  • Joaquín Bautista
Conference paper
Part of the Lecture Notes in Management and Industrial Engineering book series (LNMIE)


The time and space assembly line balancing problem (TSALBP) is a realistic multiobjective version of assembly line balancing industrial problems involving the joint optimization of conflicting criteria such as the cycle time, the number of stations, and the area of these stations. For this family of problems there is not any repository where researchers and practitioners can obtain realistic problem instances also containing information on mixed products plans. In this contribution we introduce a new TSALBP instance software generator that can produce problem instances having industrial real-like features. This generator is called NTIGen (Nissan TSALBP Instance GENerator) since it is developed from the information and real data of the assembly line and production planning of the Nissan plant of Barcelona. The NTIGen software as well as some benchmark instances are publicly available on Internet and could be used by researchers to carry out general TSALBP experiments and to also discriminate between different assembly line configurations when future demand conditions vary.


Time and space assembly line balancing Problem instance generator Mixed products Nissan Optimization 



This work has been supported by Ministerio de Economía y Competitividad under project SOCOVIFI2 (TIN2012-38525-C02-01 and TIN2012-38525-C02-02), and under PROTHIUS-III: DPI2010-16759, both including EDRF funding.


  1. 1.
    Bautista J, Pereira J (2007) Ant algorithms for a time and space constrained assembly line balancing problem. Eur J Oper Res 177:2016–2032CrossRefzbMATHGoogle Scholar
  2. 2.
    Baybars I (1986) A survey of exact algorithms for the simple assembly line balancing problem. Manage Sci 32:909–932CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bhattacharjee TK, Sahu S (1990) Complexity of single model assembly line balancing problems. Eng Costs Prod Econ 18:203–214CrossRefGoogle Scholar
  4. 4.
    Boysen N, Fliedner M, Scholl A (2007) A classification of assembly line balancing problems. Eur J Oper Res 183:674–693CrossRefzbMATHGoogle Scholar
  5. 5.
    Chica M, Cordón O, Damas S, Bautista J (2010) Multiobjective, constructive heuristics for the 1/3 variant of the time and space assembly line balancing problem: ACO and random greedy search. Inf Sci 180:3465–3487CrossRefGoogle Scholar
  6. 6.
    Chica M, Cordón O, Damas S (2011) An advanced multi-objective genetic algorithm design for the time and space assembly line balancing problem. Comput Ind Eng 61:103–117CrossRefGoogle Scholar
  7. 7.
    Chica M, Cordón O, Damas S, Bautista J (2012) Multiobjective memetic algorithms for time and space assembly line balancing. Eng Appl Artif Intell 25:254–273CrossRefGoogle Scholar
  8. 8.
    Dar-El EM (1975) Solving large single-model assembly line balancing problems—a comparative study. AIIE Trans 7:302–310CrossRefGoogle Scholar
  9. 9.
    Otto A, Otto C, Scholl A (2011) SALBPgen—a systematic data generator for (simple) assembly line balancing. Jena Research Papers in Business and Economics 5Google Scholar
  10. 10.
    Scholl A, Becker C (2006) State-of-the-art exact and heuristic solution procedures for simple assembly line balancing. Eur J Oper Res 168:666–693CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Manuel Chica Serrano
    • 1
    Email author
  • Óscar Cordón García
    • 1
  • Sergio Damas Arroyo
    • 1
  • Joaquín Bautista
    • 2
  1. 1.European Centre for Soft ComputingMieresSpain
  2. 2.Dpto. Organización de EmpresasETSEIB, UPC CatalunyaBarcelonaSpain

Personalised recommendations