Similar Search Results

Improved Lower Bounds For The Capacitated Lot Sizing Problem With Set Up Times

Degraeve, Z.; Jans, R.F. - Erasmus Research Institute of Management (ERIM), ERIM … - 2003

We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network...

Persistent link: https://www.econbiz.de/10005288759

Lower bounds and recursive methods for the problem of adjudicating conflicting claims.

Dominguez, Diego - Centro de Investigación Económica (CIE), Departamento … - 2007

For the problem of adjudicating conflicting claims, we study lower bounds on the awards of each agent. We propose extending a lower bound by performing the following operation: (i) for each problem, assign the lower bound and revise the problem accordingly; (ii) assign the bound of the revised...

Persistent link: https://www.econbiz.de/10005220160

Buy-and-Hold Strategies and Comonotonic Approximations

Marin-Solano, J.; Roch, O.; Dhaene, J.; Ribas, C.; … - Facultat d'Economia i Empresa, Universitat de Barcelona - 2009

We investigate optimal buy-and-hold strategies for terminal wealth problems in a multi-period framework. As terminal wealth is a sum of dependent random variables, each of these variables corresponding to an amount of capital that has been invested in a particular asset at a particular date, we...

Persistent link: https://www.econbiz.de/10005022327

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

Ramalhinho-Lourenço, Helena - Department of Economics and Business, Universitat … - 1998

The standard one-machine scheduling problem consists in scheduling a set of jobs in one machine which can handle only … preemption is allowed. In this work, we consider a special case of the one-machine preemption scheduling problem with time- lags … lower bounds for NP-hard one-machine and job-shop scheduling problems. We present some computational results of this …

Persistent link: https://www.econbiz.de/10005707986

Fair bounds based solidarity

Peris, Josep E.; Jiménez-Gómez, José M. - Departamento de Métodos Cuantitativos y Teoría … - 2012

How should scholarships be distributed among the (public) higher education students? We raise this situation as a redistribution problem. Following the approach developed in Fleurbaey (1994) and Bossert (1995), redistribution should be based on the notion of solidarity and it reallocates...

Persistent link: https://www.econbiz.de/10010991674

Solidarity and uniform rules in bankruptcy problems

Peris, Josep E.; Jiménez-Gómez, José M. - Departamento de Métodos Cuantitativos y Teoría … - 2012

The idea of ensuring a guarantee (a minimum amount of the resources) to each agent has recently acquired great relevance, in both social and political terms. Furthermore, the notion of Solidarity has been treated frequently in redistribution problems to establish that any increment of the...

Persistent link: https://www.econbiz.de/10010991683

Development of lower bounds for the scheduling of setup tasks in serial production lines

Pessan, Cédric; Néron, Emmanuel; Haouari, Mohamed - In: European Journal of Industrial Engineering 7 (2013) 5, pp. 558-576

minimise the loss of production during these resetting phases. In this paper, we investigate the problem of scheduling … problem of scheduling operations within a production resetting can be modelled as an unrelated parallel machine scheduling …

Persistent link: https://www.econbiz.de/10010754858

Lower bounds on inequality of opportunity and measurement error

Balcázar, Carlos Felipe - In: Economics letters 137 (2015), pp. 102-105

Persistent link: https://www.econbiz.de/10011436259

Banks' expected equity-to-asset ratio bounds under foreign exchange risk

Egozcue, Martín; García, Luis Fuentes - In: The journal of risk model validation 10 (2016) 1, pp. 1-20

Persistent link: https://www.econbiz.de/10011485149

Lower bounds for Bruss' odds problem with multiple stoppings

Matsui, Tomomi; Ano, Katsunori - In: Mathematics of operations research 41 (2016) 2, pp. 700-714

Persistent link: https://www.econbiz.de/10011520525