the research on project scheduling has widely expanded over the last few decades. the vast majority of these research efforts focus on exact and suboptimal procedures for constructing a workable schedule, assuming complete information and a static deterministic problem environment. project activities are scheduled subject to both technological precedence constraints and resource constraints, mo...

Deep deterministic policy gradient (DDPG) has been proved to be effective in optimizing particle swarm optimization (PSO), but whether DDPG can optimize multi-objective discrete (MODPSO) remains determined. The present work aims probe into this topic. Experiments showed that the not only quickly improve convergence speed of MODPSO, also overcome problem local optimal solution MODPSO may suffer....

This paper investigates the integration of strategic and tactical decisions in the supply chain network design (SCND) considering assembly line balancing (ALB) under demand uncertainty. Due to the decentralized decisions, a novel bi-level stochastic programming (BLSP) model has been developed in which SCND problem has been considered in the upper-level model, while the lower-level model contain...

In MIndiGolog, agents work concurrently to perform a sequence of actions in order to accomplish some task. The domain in which agents operate is static and deterministic, meaning each discrete action produces a predetermined result. The real world equivalent of some of these actions may have a number of possible results, and it may be impossible to distinguish which outcome will occur prior to ...

The hypothesis underlying topomer development is that describing molecular structures consistently may be at least as productive as describing them more realistically but incompletely. A general protocol is detailed for deterministically generating self-consistent shapes of molecular fragments from their topologies. These and other extensions to the topomer methodology are validated by repetiti...

We consider max coloring on hereditary graph classes. The problem is defined as follows. Given a graph G = (V, E) and positive node weights w : V → (0,∞), the goal is to find a proper node coloring of G whose color classes C1, C2, . . . , Ck minimize k ∑ i=1 maxv∈Ci w(v). We design a general framework which allows to convert approximation algorithms for standard node coloring into algorithms fo...

Abstract. Consider a N × n random matrix Yn = (Y n ij ) where the entries are given by Y n ij = σij(n) √ n X ij , the X n ij being independent and identically distributed, centered with unit variance and satisfying some mild moment assumption. Consider now a deterministic N×n matrix An whose columns and rows are uniformly bounded for the Euclidean norm. Let Σn = Yn + An. We prove in this articl...

After we have made those assumptions, we now can deterministically transfer the color from one place to another. Note that there is a big difference between "reproducing" one color at a different location and "deterministically transferring one set of color data to another location". The deterministic transfer is limited to the small set of physical metrics we decided to call "color". All other...

Efficient evaluation strategies for declarative updates have rarely been investigated. Due to possible dependencies between the resulting database state and the order in which records (objects) are processed, usually declarative updates are evaluated in a set-oriented way in order to ensure a deterministic evaluation. In this paper, we show that such dependencies can be detected by exploiting k...

We consider the problem of enumerating all extreme points of a given set P of n points in d dimensions. We present an algorithm with O(n) space and O(nm) time where m is the number of extreme points of P. We also present an algorithm to compute the depth of each point of the given set of n points in d-dimensions. This algorithm has complexity O(n 2) which signiicantly improves the O(n 3) comple...