Stronger upper and lower bounds for a hard batching problem to feed assembly lines.
Alexandre Salles da CunhaMaurício Cardoso de SouzaPublished in: Electron. Notes Discret. Math. (2008)
Keyphrases
- upper and lower bounds
- assembly line
- precedence constraints
- assembly line balancing
- upper bound
- lower bound
- scheduling problem
- beam search
- lower and upper bounds
- branch and bound algorithm
- production line
- processing times
- branch and bound
- sample complexity
- manufacturing systems
- single machine
- multiple objectives
- optimization model
- multistage
- partially ordered
- parallel machines
- complex systems
- bin packing
- markov random field
- small number