Ranking Dispatching Rules by Data Envelopment Analysis in a Job Shop Environment

Abstract

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.

Additional information

Notes on contributors

Yih-Long Chang

Yih-Long Chang is an Associate Professor of the School of Management at the Georgia Institute of Technology. He received his Ph.D. from the University of Texas at Austin.

Toshiyuki Sueyoshi

Toshiyuki Sueyoshi is working at the Science University of Tokyo. He received his M.E. from Tokyo Institute of Technology and his Ph.D. from the University of Texas at Austin.

Robert S. Sullivan

Robert Sullivan is the Director of ICC Institute of the University of Texas at Austin. He received his Ph.D. from Pennsylvania State University.