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:

ISSN

1572-9338

Search In ISSN:
Search In Title Of Papers:

Supply planning models for a remanufacturer under

Authors: Kyung Sung Jung Milind Dawande H Neil Geismar V Daniel R Guide Chelliah Sriskandarajah
Publish Date: 2014/03/21
Volume: 240, Issue: 2, Pages: 533-581
PDF Link

Abstract

We study a supply planning problem in a manufacturing system with two stages The first stage is a remanufacturer that supplies two closelyrelated components to the second manufacturing stage which uses each component as the basis for its respective product The used products are recovered from the market by a thirdparty logistic provider through an established reverse logistics network The remanufacturer may satisfy the manufacturer’s demand either by purchasing new components or by remanufacturing components recovered from the returned used products The remanufacturer’s costs arise from product recovery remanufacturing components purchasing original components holding inventories of recovered products and remanufactured components production setups at the first stage and at each component changeover disposal of recovered products that are not remanufactured and coordinating the supply modes The objective is to develop optimal production plans for different production strategies These strategies are differentiated by whether inventories of recovered products or remanufactured components are carried and by whether the order in which retailers are served during the planning horizon may be resequenced We devise production policies that minimize the total cost at the remanufacturer by specifying the quantity of components to be remanufactured the quantity of new components to be purchased from suppliers and the quantity of recovered used products that must be disposed The effects of production capacity are also explored A comprehensive computational study provides insights into this closedloop supply chain for those strategies that are shown to be NPhardEven–Odd Partition Garey et al 1988 given an integer B a set of 2t positive integers A = a 1 a 2…a 2t−1 a 2t such that a 1 a 2 ⋯ a 2t−1 a 2t and sumnolimits a iin A a i= 2B does there exist a partition of A into two disjoint subsets A 1 and A 2 such that sumnolimits a kin A 1a k=sumnolimits a jin A 2a j=BA 1 = A 2=t and that each of A 1 A 2 contains exactly one of a 2i−1 and a 2i for i = 1 2…t


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. Service outsourcing under different supply chain power structures
  5. Time-dependent analysis for refused admissions in clinical wards
  6. Optimal design of container inspection strategies considering multiple objectives via an evolutionary approach
  7. A class of nonsmooth fractional multiobjective optimization problems
  8. Exploring the complexity boundary between coloring and list-coloring
  9. Lipschitz and differentiability properties of quasi-concave and singular normal distribution functions
  10. Managerial insights from service industry models: a new scenario decomposition method
  11. Curriculum-based course timetabling with SAT and MaxSAT
  12. Setting handicaps to industrial sectors in DEA illustrated by Ethiopian industry
  13. Using linear programming to analyze and optimize stochastic flow lines
  14. Retail service for mixed retail and E-tail channels
  15. Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover
  16. Gated polling with stationary ergodic walking times, Markovian routing and random feedback
  17. A dynamic vehicle routing problem with multiple delivery routes
  18. An empirical examination of energy consumption, behavioral intention, and situational factors: evidence from Beijing
  19. Reverse-engineering country risk ratings: a combinatorial non-recursive model
  20. A multi-stage IP-based heuristic for class timetabling and trainer rostering
  21. Scheduling preparation of doses for a chemotherapy service
  22. Scenario decomposition of risk-averse multistage stochastic programming problems
  23. A robust optimization solution to bottleneck generalized assignment problem under uncertainty
  24. The crew timetabling problem: An extension of the crew scheduling problem
  25. Relations between threshold and k -interval Boolean functions
  26. Network models and biproportional rounding for fair seat allocations in the UK elections
  27. An out-of-sample evaluation framework for DEA with application in bankruptcy prediction
  28. A study on supply chain investment decision-making and coordination in the Big Data environment
  29. An efficient model formulation for level of repair analysis
  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: