Buscar
Mostrando ítems 1-10 de 82
Comparison of mip models for the integrated lot-sizing and one-dimensional cutting stock problem
(2016-01-01)
Production processes comprising both the lot-sizing problem and the cutting stock problem are frequent in various industrial sectors. However these problems are usually treated separately, which can generates suboptimal ...
An algorithm for the serial capacitated economic lot-sizing problem with non-speculative costs and stationary capacities
(UR. FI – INCO., 2010)
We address the serial capacitated economic lot-sizing problem under particular assumptions on the costs and the capacity pattern. We prove that when the involved costs are non-speculative with respect to the transfer to ...
Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging
(2013-08-21)
The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and ...
Genetic algorithm, MIP and improvement heuristic applied to the MLCLP with backlogging
(2013-08-21)
The present paper solves the multi-level capacitated lot sizing problem with backlogging (MLCLSPB) combining a genetic algorithm with the solution of mixed-integer programming models and the improvement heuristic fix and ...
A Hybrid Heuristic Approach to Solve the Multi Level Capacitated Lot Sizing Problem
(Ieee, 2011-01-01)
This paper presents preliminary results found by a hybrid heuristic applied to solve the Multi-Level Capacitated Lot Sizing Problem (MLCLSP). The proposed method combines a multi-population genetic algorithm and fix-and-optimize ...
A hybrid heuristic approach to solve the multi level capacitated lot sizing problem
(2011-08-29)
This paper presents preliminary results found by a hybrid heuristic applied to solve the Multi-Level Capacitated Lot Sizing Problem (MLCLSP). The proposed method combines a multi-population genetic algorithm and fix-and-optimize ...
GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem
(ELSEVIER SCIENCE BV, 2010)
This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few ...
A hybrid heuristic for the multi-plant capacitated lot sizing problem with setup carry-over
(Sociedade Brasileira de Computação, 2008)
This paper addresses the capacitated lot sizing problem (CLSP) with a single stage composed of multiple plants, items and periods with setup carry-over among the periods. The CLSP is well studied and many heuristics have ...
A HEURISTIC FOR A RESOURCE-CAPACITATED MULTISTAGE LOT-SIZING PROBLEM WITH LEAD TIMES
(Stockton PressBasingstokeInglaterra, 1995)