A survey on genomic data by privacy-preserving techniques perspective

Nowadays, the purpose of human genomics is widely emerging in health-related problems and also to achieve time and cost-efficient healthcare. Due to advancement in genomics and its research, development in privacy concerns is needed regarding querying, accessing and, storage and computation of the genomic data. While the genomic data is widely accessible, the privacy issues may emerge due to the untrusted third party (adversaries/researchers), they may reveal the information or strategy plans regarding the genome data of an individual when it is requested for research purposes. To mitigate this problem many privacy-preserving techniques are used along with cryptographic methods are briefly discussed. Furthermore, efficiency and accuracy in a secure and private genomic data computation are needed to be researched in future.     

Make-or-buy service capacity decision in a supply chain providing after-sales service

We consider a supply chain comprising a manufacturer and a retailer. The manufacturer supplies a product to the retailer, while the retailer sells the product bundled with after-sales service to consumers in a fully competitive market. The sales volume is affected by the retailer’s service-level commitment. The retailer can build service capacity in-house at a deterministic price before service demand is realized, or buy the service from an outsourcing market at an uncertain price after service demand realization. We find that the outsourcing market encourages the retailer to make a higher level of service commitment, while prompting the manufacturer to reduce the wholesale price, resulting in more demand realization. We analyze how the expected cost of the service in the outsourcing market and the retailer’s risk attitude affect the decisions of both parties. We derive the conditions under which the retailer is willing to build service capacity in-house and under which it will buy the service from the outsourcing market. Moreover, we find that the manufacturer’s sharing with the retailer the cost to build service capacity improves the profits of both parties.     

A hybrid model for selection of an outsourcing provider

Outsourcing is a good strategy for firms that need to reduce operating costs and improve competitiveness and it is important that firms scientifically select appropriate outsourcing providers. Some efforts have been made to find systematic ways to deal with outsourcing problems, but these efforts incorrectly assumed that the criteria used in the decision process are independent, which is not true in the real world. In this study, we propose a new hybrid multiple criteria decision-making (MCDM) model, which addresses the dependent relationships between the various criteria. The relations-structure among the criteria is built with the aid of the decision-making trial and evaluation laboratory (DEMATEL) method. Decision-makers tend to hold diverse opinions about their preferences due to incomplete information and knowledge, or inherent conflict between various departments. We further used the fuzzy preference programming and the analytic network process (ANP) to form a model for the selection of partners for outsourcing providers. The proposed model can help practitioners improve their decision making process, especially when criteria are numerous and inter-related. The method is demonstrated using data from a Taiwanese airline.     

Two-machine flow shop scheduling problem with an outsourcing option

We consider a two-machine flow shop problem in which each job is processed through an in-house system or outsourced to a subcontractor. A schedule is established for the in-house jobs, and performance is measured by the makespan. Jobs processed by subcontractors require paying an outsourcing cost. The objective is to minimize the sum of the makespan and total outsourcing costs. We show that the problem is NP-hard in the ordinary sense. We consider a special case in which each job has a processing requirement, and each machine a characteristic value. In this case, the time a job occupies a machine is equal to the job’s processing requirement plus a setup time equal to the characteristic value of that machine. We introduce some optimality conditions and present a polynomial-time algorithm to solve the special case.     

企业关系视角下的知识流程外包策略研究

基于企业的关系视角,讨论了企业选择知识流程外包的可能动机。具体而言,在控制服务成本差的背景下,考虑企业间协同合作产生的关系租金与知识传递的信息粘性对企业选择外包策略进行分析。区别于传统基于服务成本差的外包策略,结论指出由于存在信息粘性的影响,服务提供商仅仅具有较高信息处理能力是不能保证企业选择外包。同时指出,即使当服务提供商不具有任何成本优势,基于合作战略的高关系租金也能成为企业选择知识流程外包的又一动机。通过将成本优势和关系优势进行比较,我们指出两类优势对于企业的外包绩效具有互补性,对于企业进行知识流程外包的决策具有替代性。     

Outsourcing and scheduling for two-machine ordered flow shop scheduling problems

This paper considers a two-machine ordered flow shop problem, where each job is processed through the in-house system or outsourced to a subcontractor. For in-house jobs, a schedule is constructed and its performance is measured by the makespan. Jobs processed by subcontractors require paying an outsourcing cost. The objective is to minimize the sum of the makespan and the total outsourcing cost. Since this problem is NP-hard, we present an approximation algorithm. Furthermore, we consider three special cases in which job j has a processing time requirement p_j, and machine i a characteristic q_i. The first case assumes the time job j occupies machine i is equal to the processing requirement divided by a characteristic value of machine i, that is, p_j/q_i. The second (third) case assumes that the time job j occupies machine i is equal to the maximum (minimum) of its processing requirement and a characteristic value of the machine, that is, max{p_j, q_i} (min{p_j, q_i}). We show that the first and the second cases are NP-hard and the third case is polynomially solvable.     

Outsourcing suppliers as downstream competitors: Biting the hand that feeds

In this paper, we highlight an aspect of supplier opportunism in the outsourcing paradox that has largely been ignored by extant research – the supplier as a direct competitor of the buyer firm. In light of this paradox, we offer a game-theoretic framework in which we identify conditions under which firms could alleviate or mitigate this outsourcing problem. Our results show that apart from transaction costs, firm-level capabilities (both ordinary and dynamic) play important roles in determining the make only, buy only, or make-and-buy options a firm could exercise in countering the threat of the supplier as a potential competitor in the downstream marketplace.     

Offshore outsourcing decision making: A policy-maker’s perspective

This research aims at finding the best governing policy for offshore outsourcing of business activities. We use Analytical Network Process, a multicriteria decision making methodology, to create the evaluation framework. From the perspective of decision makers, stakeholders, and influence groups, four policy options are evaluated with respect to approximately 50 economic, political, technological and other factors. The model provides both long-term and short-term views of the outsourcing issue concerned to all parties. The all-inclusive approach helps policy makers to decide on the best policy and has the potential to ease tension between proponents and opponents of offshore outsourcing.     

The risk and information sharing of application services supply chain

We study an application services supply chain consisting of one application service provider (ASP) and one application infrastructure provider (AIP). The AIP supplies the computer capacity to the ASP that in turn sells the value-added application services to the market. The market is characterized by a price-sensitive random demand. The ASP’s objective is to determine the optimal price of its service to the market and the optimal capacity to purchase from the AIP. The AIP’s goal on the other hand is to maximize its profit from selling the capacity to the ASP.     

An efficient three-level heuristic for the large-scaled multi-product production routing problem with outsourcing

A classic production routing problem (PRP), in which a plant produces and distributes a single product to a set of customers over a finite time horizon, consists of planning simultaneously the production, inventory and routing activities to minimize the total cost. The last few decades have witnessed the increasing efforts made to solve such a complex problem. In this paper, we investigate a generalized PRP by considering multiple products and outsourcing (MPRP-OS). The newly studied problem is first formulated into a mixed integer linear program. Then a three-level mathematical-programming-based heuristic called TLH is developed to solve it. TLH combines a two-phase iterative method, a repairing strategy and a fix-and-optimize procedure to find near-optimal solutions. In addition, it is adaptable to solve the classic PRP. Computational experiments on 225 newly generated MPRP-OS instances with up to 200 customers, 20 vehicles, 6 periods and 12 products show the effectiveness and efficiency of the proposed heuristic. The performance of TLH is further demonstrated by testing 1530 classic PRP benchmark instances with up to 200 customers, 13 vehicles and 20 periods. Experimental results indicate that TLH is able to solve large-sized MPRP-OS instances within short computation times. In addition, TLH provides new best solutions for 283 out of 1530 benchmark instances.