The existing research on the two-workshop integrated scheduling problem with symmetrical
resources does not consider the complex product attribute structure and the objective …

Let G be an unweighted n-node undirected graph. A β-additive spanner of G is a spanning
subgraph H of G such that distances in H are stretched at most by an additive term β wrt the …

针对多品种, 小批量复杂产品综合调度中, 因忽略工艺树整体约束关系而产生较多设备空隙,
影响设备利用率的问题, 提出了工艺树子树循环分解的资源协同综合调度算法 …

Abstract The Minimum Size Tree Decomposition (MSTD) and Minimum Size Path
Decomposition (MSPD) problems ask for a given n-vertex graph G and integer k, what is the …

In this work we consider two two-criteria optimization problems: given an input graph, the
goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its …

We study in this thesis optimization problems with application in optical networks. The
problems we consider are related to fault-tolerance and efficient resource allocation and the …

Nous étudions dans cette thèse des problèmes d'optimisation avec applications dans les
réseaux optiques. Les problèmes étudiés sont liés à la tolérance aux pannes et à l'utilisation …