In this paper we develop a polynomial-time approximation scheme for a particular
case of the two-machine flow shop scheduling problem with several availability
constraints on the second machine under the resumable scenario.
This work focuses on the solution of a set of algebraic nonlinear equations
representing the steady state operation of electrical power systems. The
classical modelling of the so-called power flow problem requires the statement
of the power balance equations and the specification of some network variables.
Usually Newton method is applied to solve these equations, which requires the
solution of a ... hiện toàn bộ
Capacitated covering models aim at covering the maximum amount of customers’
demand using a set of capacitated facilities. Based on the assumptions made in
such models, there is a unique scenario to open a facility in which each
facility has a pre-specified capacity and an operating budget. In this paper, we
propose a generalization of the maximal covering location problem, in which
facilities hav... hiện toàn bộ