Now showing items 462-481 of 636

    • A polyhedral study of multiechelon lot sizing with intermediate demands 

      Zhang, M.; Küçükyavuz, S.; Yaman, H. (Institute for Operations Research and the Management Sciences (I N F O R M S), 2012)
      In this paper, we study a multiechelon uncapacitated lot-sizing problem in series (m-ULS), where the output of the intermediate echelons has its own external demand and is also an input to the next echelon. We propose a ...
    • Post-disaster assessment routing problem 

      Oruç, B. E.; Kara, B. Y. (Elsevier, 2018)
      In this study, we propose a post-disaster assessment strategy as part of response operations in which effective and fast relief routing are of utmost importance. In particular, the road segments and the population points ...
    • Predictive/reactive scheduling with controllable processing times and earliness-tardiness penalties 

      Turkcan, A.; Akturk, M. S.; Storer, R. H. (Taylor & Francis, 2009)
      In this study, a machine scheduling problem with controllable processing times in a parallel-machine environment is considered. The objectives are the minimization of manufacturing cost, which is a convex function of ...
    • Preface 

      Akgül, Mustafa; Hamacher, H. W.; Tüfekçi, S. (Springer, 1992)
    • A prescription fraud detection model 

      Aral, K. D.; Güvenir H. A.; Sabuncuoğlu, T.; Akar, A. R. (Elsevier Ireland Ltd., 2012)
      Prescription fraud is a main problem that causes substantial monetary loss in health care systems. We aimed to develop a model for detecting cases of prescription fraud and test it on real world data from a large multi-center ...
    • Pricing American contingent claims by stochastic linear programming 

      Camcı, A.; Pınar, M. Ç. (Taylor & Francis, 2009)
      We consider pricing of American contingent claims (ACC) as well as their special cases, in a multi-period, discrete time, discrete state space setting. Until now, determining the buyer's price for ACCs required solving an ...
    • Pricing American perpetual warrants by linear programming 

      Vanderbei, R.J.; Pinar, M. Ç. (Society for Industrial and Applied Mathematics, 2009)
      A warrant is an option that entitles the holder to purchase shares of a common stock at some prespecified price during a specified interval. The problem of pricing a perpetual warrant (with no specified interval) of the ...
    • Pricing multiple exercise American options by linear programming 

      Giandomenico, M.; Pınar, Mustafa Ç. (Springer New York LLC, 2017)
      We consider the problem of computing the lower hedging price of American options of the call and put type written on a non-dividend paying stock in a non-recombinant tree model with multiple exercise rights. We prove using ...
    • A private contributions game for joint replenishment 

      Körpeoǧlu, E.; Şen, A.; Güler, K. (2012)
      We study a non-cooperative game for joint replenishment by n firms that operate under an EOQ-like setting. Each firm decides whether to replenish independently or to participate in joint replenishment, and how much to ...
    • A prize collecting Steiner tree approach to least cost evaluation of grid and off-grid electrification systems 

      Bolukbasi, G.; Kocaman, A. S. (Elsevier, 2018)
      The lack of access to electricity in developing countries necessitates spatial electricity planning for guiding sustainable electrification projects that evaluate the costs of centralized systems vis-a-vis decentralized ...
    • A problem space algorithm for single machine weighted tardiness problems 

      Avcı, S.; Aktürk, M. S.; Storer, R. H. (Taylor & Francis Inc., 2003)
      We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood ...
    • A problem space genetic algorithm in multiobjective optimization 

      Türkcan, A.; Aktürk, M. S. (Springer New York LLC, 2003)
      In this study, a problem space genetic algorithm (PSGA) is used to solve bicriteria tool management and scheduling problems simultaneously in flexible manufacturing systems. The PSGA is used to generate approximately ...
    • Process simulations for 3D turning using uniform and variable microgeometry PCBN tools 

      Karpat, Y.; Özel, T. (Inderscience Publishers, 2008)
      In this paper, uniform and variable edge microgeometry design inserts are utilised and tested for 3D turning process. In 3D tool engagement with workpiece, thickness of the chip varies from a maximum equal to the feed rate ...
    • Processing and environmental effects on composite repairs 

      Elaldi F.; Elaldi P. (2012)
      The scarf-joint technique is one of the latest techniques used for repairing composite aircraft structures. But this technique is mostly used at depot level repairing activities since it requires autoclave and other ...
    • Projecting the flow variables for hub location problems 

      Labbé, M.; Yaman, H. (John Wiley & Sons, 2004)
      We consider two formulations for the uncapacitated hub location problem with single assignment (UHL), which use multicommodity flow variables. We project out the flow variables and determine some extreme rays of the ...
    • Provisioning virtual private networks under traffic uncertainty 

      Altın, A.; Amaldi, E.; Belotti, P.; Pınar, M. Ç. (John Wiley & Sons, 2007)
      We investigate a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks (VPNs): given a set of terminals that must communicate with one another, and a set of possible traffic ...
    • Pure cycles in flexible robotic cells 

      Gultekin, H.; Karasan O. E.; Akturk, M. S. (Elsevier, 2009)
      In this study, an m-machine flexible robotic manufacturing cell consisting of CNC machines is considered. The flexibility of the machines leads to a new class of robot move cycles called the pure cycles. We first model the ...
    • Pure cycles in two-machine dual-gripper robotic cells 

      Gultekin, H.; Dalgıç, Ö. O.; Akturk, M. S. (Elsevier, 2017)
      We consider a robotic cell served by a dual-gripper robot that consists of identical CNC machines placed linearly and a material handling robot loading/unloading the machines and transporting the parts between them. Identical ...
    • Quantifying input uncertainty in an assemble-to-order system simulation with correlated input variables of mixed types 

      Akçay, Alp; Biller, B. (IEEE, 2014)
      We consider an assemble-to-order production system where the product demands and the time since the last customer arrival are not independent. The simulation of this system requires a multivariate input model that generates ...
    • Quantifying the value of buyer-vendor coordination: analytical and numerical results under different replenishment cost structures 

      Toptal, A.; Çetinkaya, S. (Elsevier, 2008)
      Despite a growing interest in channel coordination, no detailed analytical or numerical results measuring its impact on system performance have been reported in the literature. Hence, this paper aims to develop analytical ...