A minimax linear programming model for dispatching rule selection

Gholam R. Amin, Ahmed El-Bouri

Research output: Contribution to journalArticle

2 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

Fingerprint

Linear programming
Scheduling

Keywords

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

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

A minimax linear programming model for dispatching rule selection. / Amin, Gholam R.; El-Bouri, Ahmed.

In: Computers and Industrial Engineering, Vol. 121, 01.07.2018, p. 27-35.

Research output: Contribution to journalArticle

@article{dd60c79848184f5ba816883f44700d99,
title = "A minimax linear programming model for dispatching rule selection",
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.",
keywords = "Aggregation, Data envelopment analysis, Dispatching rules, Minimax linear programming, Multi-criteria decision making",
author = "Amin, {Gholam R.} and Ahmed El-Bouri",
year = "2018",
month = "7",
day = "1",
doi = "10.1016/j.cie.2018.05.021",
language = "English",
volume = "121",
pages = "27--35",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - A minimax linear programming model for dispatching rule selection

AU - Amin, Gholam R.

AU - El-Bouri, Ahmed

PY - 2018/7/1

Y1 - 2018/7/1

N2 - 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.

AB - 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.

KW - Aggregation

KW - Data envelopment analysis

KW - Dispatching rules

KW - Minimax linear programming

KW - Multi-criteria decision making

UR - http://www.scopus.com/inward/record.url?scp=85047085795&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85047085795&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2018.05.021

DO - 10.1016/j.cie.2018.05.021

M3 - Article

VL - 121

SP - 27

EP - 35

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -