Scheduling open shops with parallel machines to minimize total completion time.
B. NaderiS. M. T. Fatemi GhomiMajid AminnayeriMostafa ZandiehPublished in: J. Comput. Appl. Math. (2011)
Keyphrases
- minimize total
- parallel machines
- scheduling problem
- weighted tardiness
- release dates
- unrelated parallel machines
- sequence dependent setup times
- parallel computing
- single machine
- precedence constraints
- shared memory
- setup times
- search algorithm
- total cost
- lot sizing
- resource allocation
- response time
- supply chain
- probabilistic model
- np hard