A polynomial-time algorithm for the preemptive mixed-shop problem with two unit operations per job.
Aldar DugarzhapovAlexander V. KononovPublished in: J. Sched. (2016)
Keyphrases
- computational complexity
- times faster
- recognition algorithm
- experimental evaluation
- dynamic programming
- preprocessing
- search space
- objective function
- learning algorithm
- optimization algorithm
- cost function
- np hard
- computational cost
- worst case
- improved algorithm
- probabilistic model
- segmentation algorithm
- linear programming
- simulated annealing
- significant improvement
- average case
- space complexity
- neural network
- detection algorithm
- expectation maximization
- k means
- genetic algorithm