Parallel computation approach to solve total cost minimization scheduling problem.
Radoslaw RudekAgnieszka RudekTomasz CzyzPublished in: MMAR (2011)
Keyphrases
- total cost
- parallel computation
- scheduling problem
- parallel algorithm
- optimal solution
- parallel computing
- single machine
- parallel processing
- parallel implementation
- minimum total cost
- np hard
- planning horizon
- opportunity cost
- flowshop
- lead time
- average cost
- objective function
- tabu search
- general purpose
- dynamic programming
- service level
- lot size
- holding cost