Recent Submissions

  • Job shop scheduling with beam search 

    Sabuncuoglu, I.; Bayiz, M. (Elsevier, 1999-10-16)
    Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...
  • Analysis of reactive scheduling problems in a job shop environment 

    Sabuncuoglu, I.; Bayiz, M. (Elsevier, 2000-11-01)
    In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Specifically, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, ...
  • Bivariate distribution and the hazard functions when a component is randomly truncated 

    Gurler, U. (Elsevier, 1997-01)
    In random truncation models one observes the i.i.d. pairs (Ti≤Yi), i=1, ..., n. If Y is the variable of interest, then T is another independent variable which prevents the complete observation of Y and random left truncation ...
  • Weak and strong quantile representations for randomly truncated data with applications 

    Gurler, U.; Stute, W.; Wang, J. L. (Elsevier, 1993-05-26)
    Suppose that we observe bivariate data (X,. q) only when Y, < Xi (left truncation). Denote with F the marginal d.f. of the X’s In this paper we derive a Bahadur-type representation for the quantile function of the pertaining ...
  • Bivariate density estimation with randomly truncated data 

    Gurler, U.; Prewitt, K. (Elsevier, 2000-07)
    In this study bivariate kernel density estimators are considered when a component is subject to random truncation. In bivariate truncation models one observes the i.i.d. samples from the triplets (T, Y, X) only if T less ...
  • Lot streaming in open shops 

    Sen, A.; Benli, O. (Elsevier, 1998-10)
    We study lot streaming in shops in which the order the jobs are to be processed is immaterial. For a single job case, the properties of the optimal routing is determined. For the multi job case, two machine shops are ...
  • Cyclic scheduling of a 2-machine robotic cell with tooling constraints 

    Gultekin, H.; Akturk, M. S.; Karasan, O. E. (Elsevier, 2006-10-16)
    In this study, we deal with the robotic cell scheduling problem with two machines and identical parts. In an ideal FMS, CNC machines are capable of performing all the required operations as long as the required tools are ...
  • Scheduling for non regular performance measure under the due window approach 

    Sabuncuoglu, I.; Lejmi, T. (Elsevier, 1999-10)
    In the last two decades, Just-In-Time (JIT) production has proved to be an essential requirement of world class manufacturing. This has made schedulers most concerned about the realization of a JIT environment. The ...
  • Convexity and logical analysis of data 

    Ekin, O.; Hammer, P. L.; Kogan, A. (Elsevier, 2000-08-06)
    A Boolean function is called k-convex if for any pair x,y of its true points at Hamming distance at most k, every point "between" x and y is also true. Given a set of true points and a set of false points, the central ...
  • A Neural Network Model for Scheduling Problems 

    Sabuncuoglu, I.; Gurgun, B. (Elsevier, 1996-09-06)
    Artificial neural networks (ANNs) have been successfully applied to solve a variety of problems. This paper proposes a new neural network approach to solve the single machine mean tardiness scheduling problem and the ...
  • Hazardous waste management problem: The case for incineration 

    Emek, E.; Kara, B. Y. (Elsevier, 2007-05)
    We define the hazardous waste management problem as the combined decisions of selecting the disposal method, siting the disposal plants and deciding on the waste flow structure. The hazardous waste management problem has ...
  • Accurate Calculation of Hazardous Materials Transport Risks 

    Kara, B.; Erkut, E.; Verter, V. (Elsevier, 2003-07)
    We propose two path-selection algorithms for the transport of hazardous materials. The algorithms can deal with link impedances that are path-dependent. This approach is superior to the use of a standard shortest path ...
  • The hierarchical hub median problem with single assignment 

    Yaman, H. (Elsevier, 2009-07)
    We study the problem of designing a three level hub network where the top level consists of a complete network connecting the so-called central hubs and the second and third levels are unions of star networks connecting ...
  • Ant colony optimization for the single model U-type assembly line balancing problem 

    Sabuncuoglu, I.; Erel, E.; Alp, A. (Elsevier, 2009-08)
    An assembly line is a production line in which units move continuously through a sequence of stations. The assembly line balancing problem is defined as the allocation of tasks to an ordered sequence of stations subject ...
  • Designing cost efficient content distribution networks 

    Bektas, T.; Oguz, O.; Ouveysi, I. (Elsevier, 2007-08)
    In this paper, we present a novel technique for the problem of designing a Content Distribution Network (CDN), which is a technology used to efficiently distribute electronic content throughout an existing IP network. Our ...
  • Analysis of the Behavior of Transient Period in Non-Terminating Simulations 

    Sandikci, B.; Sabuncuoglu, I. (Elsevier, 2006-08-16)
    Computer simulation is a widely used tool for analyzing many industrial and service systems. However, a major disadvantage of simulation is that the results are only estimates of the performance measures of interest, hence ...
  • Optimal bundle formation and pricing of two products with limited stock 

    Gurler, U.; Oztop, S.; Sen, A. (Elsevier, 2009-04)
    In this study, we consider the stochastic modeling of a retail firm that sells two types of perishable products in a single period not only as independent items but also as a bundle. Our emphasis is on understanding the ...
  • A comparison of fixed and dynamic pricing policies in revenue management 

    Sen, A. (Elsevier, 2013-06)
    We consider the problem of selling a fixed capacity or inventory of items over a finite selling period. Earlier research has shown that using a properly set fixed price during the selling period is asymptotically optimal ...
  • New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs 

    Erenay, F. S.; Sabuncuoglu, I.; Toptal, A.; Tiwari, M. K. (Elsevier, 2010-02-16)
    We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is important in practice, as the former criterion ...
  • A dynamic rationing policy for continuous-review inventory systems 

    Fadiloglu, M. M.; Bulut, O. (Elsevier, 2010-05-01)
    Stock rationing is an inventory policy that allows differential treatment of customer classes without using separate inventories. In this paper, we propose a dynamic rationing policy for continuous-review inventory systems, ...

View more