Scheduling Problem to be solved with Simulated Annealing heuristic

Hello,
I have a scheduling class in which i have to submit a project concerning a scheduling problem thhat i need to solve using simulated annealing. I will be presenting this Project in june, the coding part is due much earlier. Probably at the end of april. The scheduling problem is a packaging companys’ real life problem. My objective is to find an optimal job sequence that minimizes the makespan. The environment is hybrid flow-shop and i have the set-up times and completion times of each job and the speed of each machine. Would you be interested?