• DocumentCode
    3043738
  • Title

    Modelling and solving the SALB-E problem

  • Author

    Plans, J. ; Corominas, A.

  • Author_Institution
    Dept. d´´Organizacio d´´Empreses, Tech. Univ. of Catalonia, Barcelona, Spain
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    356
  • Lastpage
    360
  • Abstract
    This paper deals with the so-called SALBP-E (simple assembly line balancing problem-efficiency) problem, which consists of maximising the efficiency of an assembly line (defined as the product of the number of stations by the cycle time) in the framework of the assumptions that characterise the SALB problems. We propose mixed integer linear programming models and heuristic procedures, based on a fix-and-relax approach, to solve them
  • Keywords
    assembly planning; integer programming; linear programming; production control; SALBP-E; assembly line balancing; cycle time; efficiency; fix-and-relax; heuristics; integer programming; linear programming; production control; Additives; Assembly systems; Costs; Heuristic algorithms; Industrial control; Polarization; Production; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Assembly and Task Planning, 1999. (ISATP '99) Proceedings of the 1999 IEEE International Symposium on
  • Conference_Location
    Porto
  • Print_ISBN
    0-7803-5704-3
  • Type

    conf

  • DOI
    10.1109/ISATP.1999.782984
  • Filename
    782984