Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: Ann Oper Res

Search In Journal Title:

Abbravation: Annals of Operations Research

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1007/bf00992247

Search In DOI:

ISSN

1572-9338

Search In ISSN:
Search In Title Of Papers:

Service outsourcing under different supply chain p

Authors: Junsong Bian Kin Keung Lai Zhongsheng Hua
Publish Date: 2016/05/23
Volume: 248, Issue: 1-2, Pages: 123-142
PDF Link

Abstract

This paper studies the impact of service outsourcing under three supply chain power structures manufacturerStackelberg verticalNash and retailerStackelberg supply chains We first investigate price and service decisions by comparing the integrated channel and the decentralized channel with service outsourcing It is found that a lower retail price or a higher service level could occur in the decentralized channel with service outsourcing compared to those in the integrated channel but they never occur simultaneously Next we examine the manufacturer’s channel strategies and demonstrate that service outsourcing can always help the manufacturer earn more profit from the decentralized channel than from the integrated channel in the manufacturerStackelberg and retailerStackelberg markets as long as the retailer’s service investment is sufficiently efficient However in the verticalNash supply chain this occurs only when the manufacturer is inefficient and the retailer is efficient enough in service provision Finally comparisons of channel efficiency and numerical analysis are providedThe Hessian matrix of the profit function Pi C with respect to pC and sC is given by H 1 =left beginarrayll 2beta gamma gamma lambda M endarray right Since 2beta 0 and lambda M 0 so if 2lambda M beta gamma 20 profit function Pi C is strictly jointly concave with respect to pC and sCProfit function Pi RM with respect to uM and sM has a Hessian matrix H 2 =left beginarrayll 2beta gamma gamma lambda R endarray right Similar to Lemma 1 it is easy to check if 2lambda R beta gamma 20 holds then H 2 is strictly jointly concave in uM and sMif lambda M frac3gamma 24beta then either fracgamma 22beta lambda R le frac23lambda M or lambda R frac23lambda M holds corresponding to Delta sNge 0 or Delta sN0 respectivelyNext we prove the case for verticalNash market First comparing pN and pC we have Delta pN=pNpC=frac2lambda R alpha 3lambda R beta gamma 2fraclambda M alpha 2lambda M beta gamma 2=fracleft lambda M lambda R beta 2lambda R gamma 2+lambda M gamma 2 right alpha left 2lambda M beta gamma 2 right left 3lambda R beta gamma 2 right Delta pN0 if left 2gamma 2lambda M beta right lambda R lambda M gamma 2 which is always satisfied when lambda M ge frac2gamma 2beta Note that inequalitylambda R fracgamma 22beta must hold to guarantee the retailer’s participation If fracgamma 22beta lambda M le frac2gamma 23beta then fraclambda M gamma 22gamma 2lambda M beta le fracgamma 22beta lambda R which leads to pNpC Finally if frac2gamma 23beta lambda M frac2gamma 2beta pN can either be higher or lower than pC depending on whether fracgamma 22beta lambda R fraclambda M gamma 22gamma 2lambda M beta or lambda R ge fraclambda M gamma 22gamma 2lambda M beta holds ie pNleft beginarrayl le endarray right pC for left beginarrayl lambda R ge fraclambda M gamma 22gamma 2lambda M beta fracgamma 22beta lambda R fraclambda M gamma 22gamma 2lambda M beta endarray right


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:

  1. A computational evaluation of a general branch-and-price framework for capacitated network location problems
  2. Index tracking with controlled number of assets using a hybrid heuristic combining genetic algorithm and non-linear programming
  3. Evolutionary coalitional games for random access control
  4. Time-dependent analysis for refused admissions in clinical wards
  5. Optimal design of container inspection strategies considering multiple objectives via an evolutionary approach
  6. A class of nonsmooth fractional multiobjective optimization problems
  7. Exploring the complexity boundary between coloring and list-coloring
  8. Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions
  9. Managerial insights from service industry models: a new scenario decomposition method
  10. Curriculum-based course timetabling with SAT and MaxSAT
  11. Setting handicaps to industrial sectors in DEA illustrated by Ethiopian industry
  12. Using linear programming to analyze and optimize stochastic flow lines
  13. Retail service for mixed retail and E-tail channels
  14. Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover
  15. Gated polling with stationary ergodic walking times, Markovian routing and random feedback
  16. A dynamic vehicle routing problem with multiple delivery routes
  17. An empirical examination of energy consumption, behavioral intention, and situational factors: evidence from Beijing
  18. Reverse-engineering country risk ratings: a combinatorial non-recursive model
  19. A multi-stage IP-based heuristic for class timetabling and trainer rostering
  20. Scheduling preparation of doses for a chemotherapy service
  21. Scenario decomposition of risk-averse multistage stochastic programming problems
  22. A robust optimization solution to bottleneck generalized assignment problem under uncertainty
  23. The crew timetabling problem: An extension of the crew scheduling problem
  24. Relations between threshold and k -interval Boolean functions
  25. Network models and biproportional rounding for fair seat allocations in the UK elections
  26. An out-of-sample evaluation framework for DEA with application in bankruptcy prediction
  27. A study on supply chain investment decision-making and coordination in the Big Data environment
  28. An efficient model formulation for level of repair analysis
  29. Supply planning models for a remanufacturer under just-in-time manufacturing environment with reverse logistics
  30. Autonomous coalitions
  31. Spatially explicit forest harvest scheduling with difference equations
  32. An analytic framework to develop policies for testing, prevention, and treatment of two-stage contagious diseases
  33. Packet loss characteristics for M / G /1/ N queueing systems
  34. Cooperation strategy of technology licensing based on evolutionary game
  35. Tabu search approaches for solving the two-group classification problem
  36. Employee stock ownership and diversification
  37. A new decision support framework for managing foot-and-mouth disease epidemics
  38. Isomorphic scheduling problems
  39. Location of retail facilities under conditions of uncertainty
  40. Modelling either-or relations in integer programming
  41. Primal and dual bounds for the vertex p -median problem with balance constraints
  42. A simple model of optimal clearance of improvised explosive devices
  43. Evolution-inspired local improvement algorithm solving orienteering problem
  44. Nondifferentiable minimax programming problems with applications

Search Result: