Exchanging preliminary information in concurrent engineering: Alternative coordination strategies
成果类型:
Article
署名作者:
Terwiesch, C; Loch, CH; De Meyer, A
署名单位:
University of Pennsylvania; INSEAD Business School; INSEAD Business School
刊物名称:
ORGANIZATION SCIENCE
ISSN/ISSBN:
1047-7039
DOI:
10.1287/orsc.13.4.402.2948
发表日期:
2002
页码:
402-419
关键词:
preliminary information
concurrent engineering
COMMUNICATION
COORDINATION
problem-solving strategies
PRODUCT DEVELOPMENT
Information processing
摘要:
Successful application of concurrent development processes (concurrent engineering) requires tight coordination. To speed development, tasks often proceed in parallel by relying on preliminary information from other tasks, information that has not yet been finalized. This frequently causes substantial rework using as much as 50% of total engineering capacity. Previous studies have either described coordination as a complex social process, or have focused on the frequency, but not the content, of information exchanges. Through extensive fieldwork in a high-end German automotive manufacturer, we develop a framework of preliminary information that distinguishes information precision and information stability, Information precision refers to the accuracy of the information exchanged. Information stability defines the likelihood of changing a piece of information later in the process. This definition of preliminary information allows us to develop a time-dependent model for managing interdependent tasks, producing two alternative strategies: iterative and set-based coordination. We discuss the trade-offs in choosing a coordination strategy and how they change over time. This allows an organization to match its problem-solving strategy with the interdependence it faces. Set-based coordination requires an absence of ambiguity, and should be emphasized if either starvation costs or the cost of pursuing multiple design alternatives in parallel are low. Iterative coordination should be emphasized if the downstream task faces ambiguity, or if starvation costs are high and iteration (rework) costs are low.