Myopic Heuristics for the Weighted Tardiness Problem on Identical Parallel Machines.

Abstract

The authors study the problem of scheduling jobs on parallel identical machines to minimize weighted tardiness. There are no known heuristics for this problem. The heuristic rule developed is simple. It can be used in the dispatch mode which makes it very practical. Characterizations of optimal solutions are presented. Computational results show that the myopic heuristic performed well vis-a-vis other rules such as the Earliest Due Date Rule, Weighted Shortest Processing Time Rule and two versions of Montagne's Rule. Reported are computational results and also the performance of the heuristic in comparison to high computational benchmarks. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 15, 1983
Accession Number
ADA134934

Entities

People

  • R. M. V. Rachamadugu
  • T. E. Morton

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Human Systems

DTIC Thesaurus Topics

  • Algorithms
  • Coefficients
  • Computations
  • Computer Programming
  • Dynamic Programming
  • Linear Programming
  • Normal Distribution
  • Optimization
  • Parallel Processors
  • Plastic Explosives
  • Robotics
  • Scheduling (Production)
  • Security
  • Sequences
  • Transportation
  • Universities

Readers

  • Operations Research