While the concept of regular equivalence is equally applicable to dichotomous as well as valued networks, the identification of regular blocks in regular blockmodels is somewhat problematic when dealing with valued networks. Applying the standard procedure for identifying ties in such blockmodels, a procedure perhaps most suited for dichotomous networks, does tend to generate block images and r...

The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...

Four heuristic algorithms are developed for solving the generalized version of tardiness flow shop problems. We consider the generalized tardiness flow shop model with minimization of the total tardiness as its performance measure. We modify the concept of cost over time (COVERT) for the generalized version of the flow shop tardiness model and employ this concept for developing four algorithms....

In this paper, the problem of two-machine flow shop scheduling to minimize total energy costs under time-of-use tariffs is investigated. As the objective function of this study is not a regular measure, allowing intentional idle-time can be advantageous. So this study considers two approaches, one for non-delay version of the problem and the other one for a situation when inserting intentional ...

This paper gives the positive answer to the question posed in the title for a wide class of minimization criteria including the maximum completion time, maximum lateness , total completion time, total weighted completion time, total tardiness, total weighted tardiness, number of late jobs and the weighted number of late jobs. That is any scheduling problem for m identical parallel machines to m...

In this study, the performance of an irreversible regenerative Brayton cycle is sought through power maximizations using finite-time thermodynamic concept in finite-size components. Optimizations are performed using a genetic algorithm. In order to take into account the finite-time and finite-size concepts in the current problem, a dimensionless mass-flow rate parameter is used to deploy ti...

Landscape organized (or structured) heterogeneity influences hydrological and biogeochemical patterns across space time. We developed landscape indices that describe the spatial configuration of nutrient sources sinks as a function their distance to stream (lateral dimension) or outlet (longitudinal intersection with flow-accumulation areas. Using monthly nitrate, total phosphorus (TP), soluble...

In this study, the performance of an irreversible regenerative Brayton cycle is sought through power maximizations using finite-time thermodynamic concept in finite-size components. Optimizations are performed using a genetic algorithm. In order to take into account the finite-time and finite-size concepts in the current problem, a dimensionless mass-flow rate parameter is used to deploy ti...