Next Article in Journal
Fractional Dynamics and Pseudo-Phase Space of Country Economic Processes
Previous Article in Journal
Geometric Dynamics on Riemannian Manifolds
Previous Article in Special Issue
Using Dynamic Adjusting NGHS-ANN for Predicting the Recidivism Rate of Commuted Prisoners
Open AccessArticle

Clustering and Dispatching Rule Selection Framework for Batch Scheduling

Department of Industrial and Management Engineering, Hanyang University, Ansan 15588, Korea
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(1), 80; https://doi.org/10.3390/math8010080
Received: 3 December 2019 / Revised: 27 December 2019 / Accepted: 29 December 2019 / Published: 3 January 2020
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. View Full-Text
Keywords: batch scheduling; dispatching rule; neural networks; constrained k-means algorithm batch scheduling; dispatching rule; neural networks; constrained k-means algorithm
Show Figures

Figure 1

MDPI and ACS Style

Ahn, G.; Hur, S. Clustering and Dispatching Rule Selection Framework for Batch Scheduling. Mathematics 2020, 8, 80.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop