An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs

David J. Robb, Thomas R. Rohleder

Research output: Contribution to journalReview article

7 Scopus citations

Abstract

In an endeavor to broaden the application of scheduling models to decisions involving the use of a manager's time we use simulation to investigate the performance of a number of simple algorithms (including eight priority rules and a construction heuristic) in a dynamic setting with tasks arriving (randomly) and scheduling decisions being made, over time. We compare these simple methods relative to a bound that uses an adjacent pairwise interchange algorithm. We model uncertainty in task durations, and costs being incurred for early and tardy task completion (representative of JIT settings). In addition to evaluating the efficacy of the scheduling rules and various preemption strategies (using ANOVA), we highlight the managerial implications of the effects of eight environmental parameters.

Original languageEnglish (US)
Pages (from-to)349-364
Number of pages16
JournalNaval Research Logistics
Volume43
Issue number3
DOIs
StatePublished - Apr 1996

ASJC Scopus subject areas

  • Modeling and Simulation
  • Ocean Engineering
  • Management Science and Operations Research

Fingerprint Dive into the research topics of 'An evaluation of scheduling heuristics for dynamic single-processor scheduling with early/tardy costs'. Together they form a unique fingerprint.

  • Cite this