Vertical Fragmentation and International Sourcing

Author(s):  
Bilgehan Karabay
1999 ◽  
Vol 12 (6) ◽  
pp. 451-460 ◽  
Author(s):  
Martin Fraering ◽  
Sameer Prasad

2018 ◽  
Vol 118 (9) ◽  
pp. 1730-1748 ◽  
Author(s):  
Mingu Kang ◽  
Kihyun Park ◽  
Ma Ga (Mark) Yang ◽  
Mark H. Haney

Purpose The purpose of this paper is to explore how a foreign invested manufacturing company’s (FIMC) components sourcing process evolves in order to improve its supply chain outcomes in the context of China’s processing trade. Design/methodology/approach Grounded in the theory bases of the international sourcing process and supply chain integration, this study utilizes a single-case-study approach with a small- to medium-sized FIMC engaged in China’s processing trade. Findings This study identifies three stages of the components sourcing process: simple assembly stage, components localization stage and supply chain integration stage. In addition, the case study suggests that the type of processing trade evolves from processing with supplied materials to processing with imported materials as the sourcing process proceeds through the three stages and the internal and external environments change. Originality/value To our knowledge, this paper is the first to focus on an FIMC’s components sourcing process in the context of China’s processing trade. It contributes to a better understanding of how FIMCs progress through the components sourcing process and apply different types of processing trade in China to maximize their supply chain outcomes.


1995 ◽  
pp. 309-324
Author(s):  
Donald F. Wood ◽  
Anthony Barone ◽  
Paul Murphy ◽  
Daniel L. Wardlow

Author(s):  
Ashish Ranjan Mishra ◽  
Neelendra Badal

This chapter explains an algorithm that can perform vertical partitioning of database tables dynamically on distributed database systems. After vertical partitioning, a new algorithm is developed to allocate that fragments to the proper sites. To accomplish this, three major tasks are performed in this chapter. The first task is to develop a partitioning algorithm, which can partition the relation in such a way that it would perform better than most of the existing algorithms. The second task is to allocate the fragments to the appropriate sites where allocating the fragments will incur low communication cost with respect to other sites. The third task is to monitor the change in frequency of queries at different sites as well as same site. If the change in frequency of queries at different sites as well as the same site exceeds the threshold, the re-partitioning and re-allocation are performed.


Sign in / Sign up

Export Citation Format

Share Document