Dynamic programming algorithms for scheduling parallel machines with family setup times.
Scott WebsterMeral AzizogluPublished in: Comput. Oper. Res. (2001)
Keyphrases
- setup times
- parallel machines
- dynamic programming algorithms
- scheduling problem
- unrelated parallel machines
- sequence dependent setup times
- precedence constraints
- dynamic programming
- total tardiness
- weighted tardiness
- minimize total
- single server
- optimal policy
- release dates
- parallel computing
- single machine
- scheduling jobs
- lot sizing
- special case
- flowshop
- processing times
- strongly np hard
- shared memory
- identical parallel machines
- np hard
- multi item
- job shop
- probability distribution
- sufficient conditions
- single machine scheduling problem