Keyphrases
Computationally Efficient
100%
Approximation Methods
100%
Neuro-dynamic Programming
100%
Capacitated
100%
Scheduling Problem
100%
Feature Function
100%
Line Scheduling
100%
Re-entrant Lines
100%
Efficient Approximation
33%
Number of Features
33%
Optimal Scheduling
33%
Numerical Experiments
33%
Parametric Architecture
33%
Value Function
33%
Weighted Principal Component
33%
Potential Capabilities
33%
Feature Selection Methods
33%
Compact Representation
33%
Threshold Algorithm
33%
Programming Framework
33%
Statistical Evaluation
33%
Computer Science
Approximation (Algorithm)
100%
Scheduling Problem
100%
Feature Function
100%
Dynamic Programming
100%
Reentrant
100%
Feature Selection
33%
Compact Representation
33%
Function Value
33%
Scheduling Policy
33%
Programming Framework
33%
Principal Components
33%
Engineering
Dynamic Programming
100%
Feature Extraction
33%
Numerical Experiment
33%
Value Function
33%
Principal Components
33%
Scheduling Policy
33%
Selection Method
33%
Compact Representation
33%
Target Value
33%