Single machine scheduling to minimize mean absolute lateness: A heuristic solution

  • Fry T
  • Armstrong R
  • Drew Rosen L
  • 7

    Readers

    Mendeley users who have this article in their library.
  • 17

    Citations

    Citations of this article.

Abstract

This paper presents a heuristic solution procedure based on the well known methodology of adjacent pairwise interchange (API) to minimize mean absolute lateness (MAL) on a single machine. MAL is a nonregular measure of performance and schedules with inserted machine idle time may contain the global optimal solution. The heuristic solution is compared to the optimal solution for 192 randomly generated problems to investigate the effects of problem size. due date coefficient of variation, and due date lightness on the quality of the heuristic. Results indicate that none of the treatments tested significantly affected the heuristic solution. The heuristic solution was found to average about 2.49% greater than the optimal. Also, the heuristic found the optimal for 122 of the 192 randomly generated test problems. © 1990.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Timothy D. Fry

  • Ronald D. Armstrong

  • L. Drew Rosen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free