Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem

Alex J. Ruiz-Torres, E. Emory Enscore, Russell R. Barton

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

This paper presents the first part of a study of a scheduling problem where the objective is to minimize both the number of jobs late and the average flow-time. Unlike previous approaches, a weighted function of the two criteria is not utilized. Heuristics based on simulated annealing and neighborhood search are proposed with the objective of generating schedules that produce a compromise across both criteria. Simulation experiments showed that the heuristics perform well when compared to the optimal solution set for a small problem instance.

Original languageEnglish (US)
Pages (from-to)257-260
Number of pages4
JournalComputers and Industrial Engineering
Volume33
Issue number1-2
DOIs
StatePublished - Oct 1997

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem'. Together they form a unique fingerprint.

Cite this