An efficient dynamic dispatching rule for scheduling in a job shop

T. S. Raghu, Chandrasekharan Rajendran

Research output: Contribution to journalArticle

57 Scopus citations

Abstract

In this paper we present a new dispatching rule which is dynamic and global in its structure. The rule adapts itself to the variation in the shop floor utilization level and assigns appropriate weights to the process time and due date information accordingly. Another important feature of the proposed rule is that the weights to the two components, viz. the process time and the due date components, differ from machine to machine. The results of a simulation study are presented to demonstrate the effectiveness of the rule with respect to the rules most commonly used in industry and the proven rules reported in the literature. The proposed rule is found to perform quite well with respect to mean flow time, mean tardiness and variation in tardiness.

Original languageEnglish (US)
Pages (from-to)301-313
Number of pages13
JournalInternational Journal of Production Economics
Volume32
Issue number3
DOIs
StatePublished - Nov 1993
Externally publishedYes

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint Dive into the research topics of 'An efficient dynamic dispatching rule for scheduling in a job shop'. Together they form a unique fingerprint.

  • Cite this