Molecular Solutions for the Bin-packing and Minimum Makespan Scheduling Problems on DNA-based Supercomputing.
Saeid SafaeiBabak DalvandZahra DerakhshandehVahid SafaeiPublished in: PDPTA (2009)
Keyphrases
- scheduling problem
- bin packing
- flowshop
- dna computing
- graph colouring
- single machine
- processing times
- tabu search
- np hard
- optimal solution
- permutation flowshop
- setup times
- precedence constraints
- packing problem
- job shop scheduling
- sequence analysis
- search tree
- minimizing makespan
- job shop
- dna sequences
- strongly np hard
- special case
- binding sites
- job shop scheduling problem
- sequence dependent setup times
- peer to peer