An application framework for scheduling optimization problems

[1] Sequencing is the process of defining the order in which the set of jobs to be completed are done. Scheduling is the process of adding start and finish information to the job order dictated by the sequence. There are 5 basic types of scheduling: Single Machine Scheduling; Parallel Machine Scheduling; Open Shop Scheduling; Flow Shop Scheduling; and Job Shop Scheduling. This paper is about the implementation of the algorithms for these basic scheduling and types and developing heuristic approaches to more complex scheduling problems. [2] A heuristic is an algorithm which tries but not guarantees to find the optimum solution but gives good results for NP-hard or NP-complete problems. NP means non-deterministically polynomial time.