Login / Signup
An enumeration procedure for the assembly line balancing problem based on branching by non-decreasing idle time.
Mariona Vilà
Jordi Pereira
Published in:
Eur. J. Oper. Res. (2013)
Keyphrases
</>
assembly line balancing
bin packing
assembly line
goal programming
multiple criteria decision making
memetic algorithm
branch and bound
search tree
scheduling problem
search space
genetic programming
trade off
single machine