.png){kind=icon}
.png){kind=icon}
Return
A minimax linear programming model for dispatching rule selection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2018.05.021.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 multicriteria 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:
Dispatching rules
Minimax linear programming
Aggregation
Multi-criteria decision making
Data envelopment analysis
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W