Encontrados 4 documentos, a visualizar página 1 de 1
Annual Production Budget in the Beverage Industry
Luis Guimarães; Diego Klabjan; Bernardo Almada-LoboDriven by a real-world application in the beverage industry, this paper provides a design of a new VNS variant to tackle the annual production budget problem. The problem consists of the assigning and scheduling of production lots in a multi-plant environment, where each plant has a set of filling lines that bottle and pack drinks. Plans also consider final product transfers between the plants. Our algorithm fi...
Multiple Machine Continuous Setup Lotsizing with Sequence-dependent Setups
Bernardo Almada-Lobo; Diego Klabjan; Maria Antónia Carravilla; José F. OliveiraWe address the short-term production planning and scheduling problem coming from the glass container industry. A furnace melts the glass that is distributed to a set of parallel molding machines. Both furnace and machine idleness are not allowed. The resulting multi-machine multi-item continuous setup lotsizing problem with a common resource has sequence-dependent setup times and costs. Production losses are pe...
Lead time considerations for the multi-level capacitated lot-sizing problem
Christian Almeder; Diego Klabjan; B. Almada-LoboThe classical multi-level capacitated lot-sizing problem is often not suitable to correctly capture resource requirements and precedence relations. We tackle this issue by explicitly modeling these two aspects. Two models are presented; one considering batch production and the other one allowing lot-streaming. Comparisons with traditional models demonstrate the capability of the new approach to deliver more rea...
Single machine multi-product capacitated lot sizing with sequence-dependent setups
Bernardo Almada-Lobo; Diego Klabjan; Maria Antónia Carravilla; José F. OliveiraIn production planning in the glass container industry, machine-dependent setup times and costs are incurred for switch overs from one product to another. The resulting multi-item capacitated lot-sizing problem has sequence-dependent setup times and costs. We present two novel linear mixed-integer programming formulations for this problem, incorporating all the necessary features of setup carryovers. The compac...
| Financiadores do RCAAP | |||||||
|
|
|
|
|
|
||