The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Se modeliza el problema no lineal de producción de carne de vacuno por Programación Geométrica Signomial. Los datos técnicos utilizados se han extraído del trabajo de Epplin y Heady (1984). Se aplican transformaciones inversas y métodos de condensación al problema signomial para simplificar el modelo teórico. Finalmente, se calcula la composición de la ración óptima, bajo distintas consideraciones y se comentan los resultados obtenidos, que confirman y completan otros experimentales ya existentes...
The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to designing a Lagrangean based heuristic. Numerical experiments showing the efficiency of the proposed approach are...
Operation principle of the engineering systems occupies an important role in the reliability theory. In most of the studies, the reliability function of the system is obtained analytically according to the structure of the system. Also in such studies the mean operating time of the system is calculated. However, the reliability function of some systems, such as repairable system, cannot be easily obtained analytically. In this case, forming Laplace-Stieltjes transform of the system can provide a...
The -hard problem of car sequencing has received a lot of attention these last years. Whereas a direct approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car sequencing problems. The effectiveness of this approach...
The NP-hard problem of car sequencing has received a lot of attention these last years. Whereas a direct
approach based on integer programming or constraint programming is generally fruitless when the number of vehicles to
sequence exceeds the hundred, several heuristics have shown their efficiency. In this paper, very large-scale
neighborhood improvement techniques based on integer programming and linear assignment are presented for solving car
sequencing problems. The effectiveness of this approach...
A special class of scheduling problems is studied in this paper,
named Hybrid Flowshop, n jobs have to be performed
in a shop and each of them has the same routing (so this is
a flowshop). A job consists in k different operations.
A set of machines are able to perform each operation and this
set is called a stage. So when a job consists in two operations,
there are two stages in the shop. After introducing the scheduling
generalities, we define our preocupations and we propose a notation
in...
Currently displaying 1 –
20 of
39