Ranking dispatching rules by data envelopment analysis in a job shop environment.: An article from: IIE Transactions

This digital document is an article from IIE Transactions, published by Institute of Industrial Engineers, Inc. (IIE) on August 1, 1996. The length of the article is 7178 words. The page length shown above is based on a typical 300-word page. The article is delivered in HTML format and is available in your Amazon.com Digital Locker immediately after purchase. You can view it with any web browser.

From the author: This paper uses Data Envelopment Analysis (DEA) to measure multiple performance criteria for 42 dispatching rules in a job shop environment. We introduce a DEA application in production scheduling. Seven performance measures are considered in the evaluation. Without pre-assigning weights to any performance measure, DEA evaluates the efficiency of each dispatching rule relative to the other rules. After running a large number of experiments, the results show that two extreme subgroups of dispatching rules perform consistently. The shortest processing time related rules form the top group, while the longest processing time related rules form the bottom group. The due date or slack-related rules perform well in tardiness. However, they are ranked low if all seven criteria are considered together. The results provide guidance to scheduling practitioners in choosing priority dispatching rules when there are multiple objectives.

Citation Details
Title: Ranking dispatching rules by data envelopment analysis in a job shop environment.
Author: Yih-Long Chang
Publication:IIE Transactions (Refereed)
Date: August 1, 1996
Publisher: Institute of Industrial Engineers, Inc. (IIE)
Volume: v28 Issue: n8 Page: p631(12)

Distributed by Thomson Gale