Competence-driven project portfolio selection,scheduling and staff assignment

This paper presents a new model for project portfolio selection, paying specific attention to competence development. The model seeks to maximize a weighted average of economic gains from projects and strategic gains from the increment of desirable competencies. As a sub-problem, scheduling and staff assignment for a candidate set of selected projects must also be optimized. We provide a nonlinear mixed-integer program formulation for the overall problem, and then propose heuristic solution techniques composed of (1) a greedy heuristic for the scheduling and staff assignment part, and (2) two (alternative) metaheuristics for the project selection part. The paper outlines experimental results on a real-world application provided by the E-Commerce Competence Center Austria and, for a slightly simplified instance, presents comparisons with the exact solution computed by CPLEX.     

NMR assignment and characterization of proton exchange of the ellagitannin granatin B

Granatin B, a complex ellagitannin extracted from pomegranate fruit, has two equilibrating isomers, form a and form b. A full ensemble of proton and carbon‐13 NMR methods over a wide range of temperature enabled a complete assignment of the more abundant isomer and showed it to be form b. This result is based on the NMR data for granatin alone and agrees with the previous determinations which were based on a combination of chemical methods and a partial assignment of the NMR spectra. The new NMR spectra also yield exchange rates for the hydroxyl protons as a function of temperature. A molecular model involving hydrogen bonding provides an explanation for the exchange data. Copyright © 2010 John Wiley & Sons, Ltd.     

A survey of berth allocation and quay crane scheduling problems in container terminals

Due to the variety of technical equipments and terminal layouts, research has produced a multitude of optimization models for seaside operations planning in container terminals. To provide a support in modeling problem characteristics and in suggesting applicable algorithms this paper reviews the relevant literature. For this purpose new classification schemes for berth allocation problems and quay crane scheduling problems are developed. Particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.     

限位排序的若干结果

In this paper,we first consider the position restriction scheduling problems on a single machine.The problems have been solved in certain special cases,especially for those obtained by restricting the processing time pj=1.We introduce the bipartite matching algorithm to provide some polynomial-time algorithms to solve them.Then we further consider a problem on unrelated processors.     

利用最小调整法求解特殊的二维0-1规划

具有特殊约束的二维0-1规划的实际应用广泛,在解法中多是应用传统算法,或是在它基础上进行改进,但是此类解法计算繁琐不易推广.针对这种情形,本文引入最小调整法处理此类问题,并将其与传统算法进行对比,充分展示了该方法的优越性,呈现出灵活、方便、简单、易行的特点.通过举例验证了方法的有效性.     

Characteristics of Good Meta-Heuristic Algorithms for the Frequency Assignment Problem

Most writers on frequency assignment algorithms have described the details of a single algorithm, and evaluated the algorithm on selected data sets. There has been relatively little emphasis on describing the common features that are important if an algorithm is to have good performance. This paper describes the key features, with particular emphasis on algorithms for weighted fixed spectrum problems. The use of algorithms handling weighted constraints has become increasingly common in recent years. The advantages and disadvantages of weighting constraints are demonstrated.     

The Böhm–Bawerk horse market: a cooperative analysis

Single–valued solutions for the case of two-sided market games without product differentiation, also known as Böhm–Bawerk horse market games, are analyzed. The nucleolus is proved to coincide with the τ value, and is thus the midpoint of the core. The Shapley value is in the core only if the game is a square glove market, and in this case also coincides with the two aforementioned solutions.Institutional support from research grants BEC 2002-00642, FEDER and SGR2001-0029 is gratefully acknowledged     

A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation

The genetic algorithm (GA) described in this paper breeds permutations of transmitters for minimum span frequency assignment. The approach hybridizes a GA with a greedy algorithm, and employs a technique called Generalized Saturation Degree to seed the initial population. Several permutation operators from the GA literature are compared, and results indicate that position based operators are more appropriate for this kind of problem than are order based operators. My offspring versus mid-parent correlation studies on crossovers show Pearson's correlation coefficient to be a reliable predictor of performance in most cases. Results presented herein represent improvements over previously published results.     

双圈连通图的L(2,1)-labelling

给定图G,G的一个L(2,1)-labelling是指一个映射f:V(G)→{0,1,2,…},满足:当dG(u,v)=1时,f(u)-f(v)≥2;当dG(u,v)=2时,f(u)-f(v)≥1.如果G的一个L(2,1)-labelling的像集合中没有元素超过k,则称之为一个k-L(2,1)-labelling.G的L(2,1)-labelling数记作l(G),是指使得G存在k-L(2,1)-labelling的最小整数k.如果G的一个L(2,1)-labelling中的像元素是连续的,则称之为一个no-holeL(2,1)-labelling.本文证明了对每个双圈连通图G,l(G)=△ 1或△ 2.这个工作推广了[1]中的一个结果.此外,我们还给出了双圈连通图的no-hole L(2,1)-labelling的存在性.     

Structure of an unexpected trimer from the reaction of ageratochromene II with aluminum chloride

A new trimer from the reaction of ageratochromene [1] (6,7‐dimethoxy‐2,2‐dimethyl‐1‐benzopyran) with anhydrous aluminum chloride was shown to be 3,4‐dihydro‐6,7‐dimethoxy‐2,2‐dimethyl‐3‐(6′,7′‐dimethoxy‐2′,2′‐dimethyl‐2H‐1‐benzopyran‐4′‐yl)‐4‐(3′,4′‐dihydro‐6′, 7′‐dimethoxy‐2′,2′‐dimethyl‐2H‐1‐benzopyran‐3′‐yl)‐ 2H‐1‐benzopyran. Its structure was confirmed by NMR (¹H, ¹³C, DEPT‐135. COSY, HMBC, HSQC, TOCSY and NOESY), IR, mass spectra and elemental analysis. Copyright © 2002 John Wiley & Sons, Ltd.