Multiprocessor task scheduling in multistage hybrid flow-shops: A parallel greedy algorithm approach.
Cengiz KahramanOrhan EnginIhsan KayaR. Elif ÖztürkPublished in: Appl. Soft Comput. (2010)
Keyphrases
- greedy algorithm
- multistage
- dynamic programming
- scheduling algorithm
- distributed memory
- single stage
- production system
- greedy algorithms
- greedy strategy
- interconnection networks
- lot sizing
- set cover
- worst case
- objective function
- greedy heuristic
- stochastic programming
- influence maximization
- state space
- knapsack problem
- shared memory
- parallel implementation
- response time
- parallel computing
- optimal policy
- lot streaming