A minimax linear programming model for dispatching rule selection

Gholam R. Amin*, Ahmed El-Bouri

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

Dispatching rule selection is an important problem in production scheduling. This paper introduces a minimax linear programming (LP) model for dispatching rule selection in the presence of multiple criteria. The multi-criteria dispatching rule selection problem is first converted into a preference voting system, and a minimax LP model is then introduced for solving the corresponding problem. The advantage of this conversion is that it provides a way to identify dispatching rules that are moderately good in all criteria, rather than selecting dispatching rules that are good respect to only a few variables. An experimental study considering two different production priority settings is used to show the applicability of the proposed method.

Original languageEnglish
Pages (from-to)27-35
Number of pages9
JournalComputers and Industrial Engineering
Volume121
DOIs
Publication statusPublished - Jul 1 2018

Keywords

  • Aggregation
  • Data envelopment analysis
  • Dispatching rules
  • Minimax linear programming
  • Multi-criteria decision making

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Fingerprint Dive into the research topics of 'A minimax linear programming model for dispatching rule selection'. Together they form a unique fingerprint.

Cite this