Scheduling problem is NP-hard in nature.Due to quality of traditional heuristics, two enetic-based solution approaches are formulated and presented to solve in this study.