Clustering and Dispatching Rule Selection Framework for Batch Scheduling

Gilseung Ahn and Sun Hur
Additional contact information
Gilseung Ahn: Department of Industrial and Management Engineering, Hanyang University, Ansan 15588, Korea
Sun Hur: Department of Industrial and Management Engineering, Hanyang University, Ansan 15588, Korea

Mathematics, 2020, vol. 8, issue 1, 1-14

Abstract: 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.

Keywords: batch scheduling; dispatching rule; neural networks; constrained k-means algorithm (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/8/1/80/pdf (application/pdf)
https://www.mdpi.com/2227-7390/8/1/80/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:8:y:2020:i:1:p:80-:d:304839

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().