Overview:

    - Job Scheduling is considered a type of combinatorial problem.

    - The goal is to find the schedule of tasks that completes the job in the
    minimum amount of time and the minimum number of processors.

    - Scheduling problems are often represented with a Directed Acyclic Graph
    (or DAG) where the vertices represent jobs and the directed edges represent
    a required ordering of jobs.

    There are several types of problems that are considered scheduling problems:
 
            - creating a schedule consistent with precedence constraints

            - assigning jobs to people who have the appropriate skills

            - assigning jobs to time slots so that they don't conflict

            - traveling salesman problem
 
 
 
 
 
 
 
 
 
 
 

.