Understanding the complexity of knowledge integration in collaborative new product development teams: A case study

Knowledge integration is important in collaborative new product development (Co-NPD). The research literature shows that the way actors create a shared understanding about the new to create products is a quality indicator of Co-NPD. This study investigates what factors influence the creation of a shared understanding in Co-NPD. The results show factors at three different levels; the actor, project and company level. Additionally, there exist relationships across the factors. The related factors form four different types of interfaces. The interfaces differ from each other since different types of collaborative mechanisms exist within them.     

TEACHING SUPPLY CHAIN MANAGEMENT THROUGH GLOBAL PROJECTS WITH GLOBAL PROJECT TEAMS

In this article, we describe the Global Project Coordination Course, a course in which project teams composed of three students from each of two overseas universities execute company‐sponsored projects dealing with global supply chain management issues. The $75,000 to $100,00 contributed in total by the three to four sponsoring companies funds all course expenses. We assess the benefits and challenges of the use of cross‐cultural project teams with diverse educational backgrounds. We conclude that the course provides a unique and effective vehicle for furthering students' knowledge of Supply Chain Management and Information Systems, improving understanding of “soft” issues, and training students to work in diverse, global, cross‐cultural project teams.     

The matching extension problem in general graphs is co-NP-complete

A simple connected graph G with 2n vertices is said to be k-extendable for an integer k with \(0<k<n\) if G contains a perfect matching and every matching of cardinality k in G is a subset of some perfect matching. Lakhal and Litzler (Inf Process Lett 65(1):11–16, 1998) discovered a polynomial algorithm that decides whether a bipartite graph is k-extendable. For general graphs, however, it has been an open problem whether there exists a polynomial algorithm. The new result presented in this paper is that the extendability problem is co-NP-complete.     

On the NEH heuristic for minimizing the makespan in permutation flow shops

Over the last 20 years the NEH heuristic of Nawaz, Enscore, and Ham published in this journal has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. In recent years some authors claimed to develop new heuristics that are competitive or outperform NEH. Our study reveals that these claims are not justified. We also address the issue of a fair comparison of the NEH results with those obtained by metaheuristics. Finally we conduct a thorough analysis of NEH leading to its modification which secures the optimality in the two-machine case and improves the general performance.     

斯柯达转型之谜

在很长的一段时间里，总部位于捷克的斯柯达都是一家名不见经传的公司，可就在不到15年的时间里，这家公司便实现了转型，从一个行业笑料发展成了一家颇受尊重的汽车巨头。秘诀何在？答案是：质量，知识转移，资本价值，时机把握，上市速度。     

Covariate Order Tests for Covariate Effect

A new approach for constructing tests for association between a random right censored life time variable and a covariate is proposed. The basic idea is to first arrange the observations in increasing order of the covariate and then base the test on a certain point process defined by the observation times. Tests constructed by this approach are robust against outliers in the covariate values or misspecification of the covariate scale since they only use the ordering of the covariate. Of particular interest is a test based on the Anderson-Darling statistic. This test has good power properties both against monotonic and nonmonotonic dependencies between the covariate and the life time variable.