Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time.
Ji-Bo WangFeng ShanBo JiangLi-Yan WangPublished in: Appl. Math. Comput. (2006)
Keyphrases
- flowshop
- scheduling problem
- completion times
- parallel machines
- processing times
- maximum lateness
- single machine
- parallel machine scheduling problem
- identical parallel machines
- tardiness cost
- identical machines
- special case
- setup times
- sequence dependent setup times
- total weighted tardiness
- release dates
- tabu search
- np hard
- precedence constraints
- infinite horizon
- dynamic programming
- genetic algorithm
- fixed number
- optimal policy
- release times
- evolutionary algorithm