Browsing by Subject "Single machine"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    ItemOpen Access
    A new dominance rule to minimize total weighted tardiness with unequal release dates
    (Elsevier, 2001) Aktürk, M .S.; Özdemir, D.
    We present a new dominance rule by considering the time-dependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a sufficient condition for local optimality. Therefore, if any sequence violates the dominance rule then switching the violating jobs either lowers the total weighted tardiness or leaves it unchanged. We introduce an algorithm based on the dominance rule, which is compared to a number of competing heuristics for a set of randomly generated problems. Our computational results indicate that the proposed algorithm dominates the competing algorithms in all runs, therefore it can improve the upper bounding scheme in any enumerative algorithm. The proposed time-dependent local dominance rule is also implemented in two local search algorithms to guide these algorithms to the areas that will most likely contain the good solutions.
  • 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.