Optimal scheduling of manufacturing processes across multiple production lines by polynomial regression and bagged bounded binary knapsack
Abstract
The sensorisation of manufacturing operations in ‘Industry 4.0’ implies the possibility of pursuing scheduling optimisations across multiple lines. The present contribution introduces an attempt toward this objective that focuses methodologically on polynomial regression and bagged bounded binary knapsack. Results are evaluated on real data from a sensorised metal injection molding plant.
BIB_text
title = {Optimal scheduling of manufacturing processes across multiple production lines by polynomial regression and bagged bounded binary knapsack},
keywds = {
optimization, scheduling
}
abstract = {
The sensorisation of manufacturing operations in ‘Industry 4.0’ implies the possibility of pursuing scheduling optimisations across multiple lines. The present contribution introduces an attempt toward this objective that focuses methodologically on polynomial regression and bagged bounded binary knapsack. Results are evaluated on real data from a sensorised metal injection molding plant.
}
isbn = {978-2-9548927-1-9},
date = {2015-11-27},
year = {2015},
}
