Clustering and Dispatching Rule Selection Framework for Batch Scheduling

被引:5
作者
Ahn, Gilseung [1 ]
Hur, Sun [1 ]
机构
[1] Hanyang Univ, Dept Ind & Management Engn, Ansan 15588, South Korea
基金
新加坡国家研究基金会;
关键词
batch scheduling; dispatching rule; neural networks; constrained k-means algorithm; READY TIMES; FLOW-SHOP; JOBS;
D O I
10.3390/math8010080
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this study, a batch scheduling with job grouping and batch sequencing is considered. A clustering algorithm and dispatching rule selection model is developed to minimize total tardiness. The model and algorithm are based on the constrained k-means algorithm and neural network. We also develop a method to generate a training dataset from historical data to train the neural network. We use numerical examples to demonstrate that the proposed algorithm and model efficiently and effectively solve batch scheduling problems.
引用
收藏
页数:14
相关论文
共 13 条