Showing 1 - 10 of 10
This paper describes a planning problem, arising in the energy supply chain, that deals with the planning of the production runs of micro combined heat and power (microCHP) appliances installed in houses, cooperating in a fleet. Two types of this problem are described. The first one is the...
Persistent link: https://www.econbiz.de/10010871178
optimization algorithm which is independent of the number of machines. We also show that the time complexity can be reduced to O …
Persistent link: https://www.econbiz.de/10010871244
-dependent batch sizes. We study the complexity of the problem, depending on the other cost parameters, namely the setup cost, the …
Persistent link: https://www.econbiz.de/10010666116
motivated the study of the complexity of some special cases and we present complexity results on them, including hypercubes. In …
Persistent link: https://www.econbiz.de/10011052592
In this paper we present complexity results for flow shop problems with synchronous movement which are a variant of a …
Persistent link: https://www.econbiz.de/10011117508
paper, we study the algorithmic complexity of the two resulting planning problems. For minimizing costs, a classical dynamic …
Persistent link: https://www.econbiz.de/10011190778
the knapsack problem are next examined. We provide a study of complexity of the problem, for some of its special cases …
Persistent link: https://www.econbiz.de/10010574164
This paper introduces new environmental constraints, namely carbon emission constraints, in multi-sourcing lot-sizing problems. These constraints aim at limiting the carbon emission per unit of product supplied with different modes. A mode corresponds to the combination of a production facility...
Persistent link: https://www.econbiz.de/10010608506
’s complexity, and we compare two integer programming formulations. Furthermore, a maximization variant of Red–Blue TP is presented …
Persistent link: https://www.econbiz.de/10010776928
problems. We prove, however, that there exists a subset of problems for which the computational complexity remains NP-hard. The …
Persistent link: https://www.econbiz.de/10011209382