Computationally efficient neuro-dynamic programming approximation method for the capacitated re-entrant line scheduling problem
Year of publication: |
2012
|
---|---|
Authors: | Choi, Jin Young ; Kim, Seoung Bum |
Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 50.2012, 8 (15.4.), p. 2353-2362
|
Subject: | capacitated re-entrant line | data mining | feature selection | neuro-dynamic programming | principal component analysis | scheduling | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Data Mining | Data mining | Heuristik | Heuristics |
-
Exact and heuristic algorithms for the maximum weighted submatrix coverage problem
Sinnl, Markus, (2022)
-
Improving a state-of-the-art heuristic for the minimum latency problem with data mining
Santana, Ítalo, (2022)
-
Karthikeyan, S., (2012)
- More ...
-
Comments on: Optimization and data mining in medicine
Chen, Victoria C. P., (2009)
-
A finite-sample simulation study of cross validation in tree-based models
Kim, Seoung Bum, (2009)
-
A data-integrated simulation-based optimization for assigning nurses to patient admissions
Sundaramoorthi, Duraikannan, (2010)
- More ...