Browsing by Subject "Computer programming, algorithms"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    Data dependent worst case bound improving techniques in zero-one programming
    (Elsevier BV, 1991) Oğuz, Osman
    A simple perturbation of data is suggested for use in conjunction with approximation algorithms for the purpose of improving the available bounds (upper and lower), and the worst case bounds. The technique does not require the approximation algorithm (heuristic) to provide a worst case bound to be applicable.
  • Thumbnail Image
    ItemOpen Access
    Sequencing jobs on a single machine with a common due date and stochastic processing times
    (1991) Sarin, S. C.; Erel, Erdal; Steiner, G.
    This paper presents a procedure for sequencing jobs on a single machine with jobs having a common due date and stochastic processing times. The performance measure to be optimized is the expected incompletion cost. Job processing times are normally distributed random variables, and the variances of the processing times are proportional to their means. The optimal sequences are shown to have a W- or V-shape. Based on this property computationally attractive solution methods are presented.