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.
In this paper, a mathematical model is developed to solve a staff scheduling
problem for a telecommunications center. Currently, weekly schedules are
manually produced. The manual nature of the process and the large number of
constraints and goals lead to a situation where the used schedules are both
inefficient and unfair. A zero-one linear goal programming model is suggested to
find an optimized... hiện toàn bộ
In this paper, we present an exact solution procedure for the design of
two-layer wavelength division multiplexing (WDM) optical networks with
wavelength changers and bifurcated flows. This design problem closely resembles
the traditional multicommodity flow problem, except that in the case of WDM
optical networks, we are concerned with the routing of multiple commodities in
two network layers. Co... hiện toàn bộ