Queueing Theory and Scheduling

  1. Single Machine Scheduling
    1. Non-Preemptive Algorithms
      1. First-Come First-Served (FCFS)
        1. Algorithm Description
          1. Performance Analysis
          2. Shortest Processing Time (SPT)
            1. Algorithm Description
              1. Optimality Properties
                1. Mean Flow Time Minimization
                2. Longest Processing Time (LPT)
                  1. Algorithm Description
                  2. Earliest Due Date (EDD)
                    1. Algorithm Description
                      1. Maximum Lateness Minimization
                        1. Optimality Proof
                        2. Weighted Shortest Processing Time (WSPT)
                          1. Algorithm Description
                            1. Weighted Mean Flow Time
                            2. Moore's Algorithm
                              1. Minimizing Number of Tardy Jobs
                                1. Algorithm Description
                                  1. Optimality Proof
                                2. Preemptive Algorithms
                                  1. Shortest Remaining Processing Time (SRPT)
                                    1. Algorithm Description
                                      1. Mean Flow Time Optimality
                                      2. Earliest Deadline First (EDF)
                                        1. Algorithm Description
                                          1. Feasibility Analysis
                                          2. Preemptive Resume vs Restart
                                          3. Dynamic Programming Approaches
                                            1. Problem Formulation
                                              1. State Space Definition
                                                1. Recursive Relations
                                                  1. Computational Complexity
                                                  2. Branch and Bound Methods
                                                    1. Tree Construction
                                                      1. Bounding Functions
                                                        1. Branching Strategies
                                                          1. Pruning Techniques

                                                        Previous

                                                        6. Fundamentals of Scheduling

                                                        Go to top

                                                        Next

                                                        8. Parallel Machine Scheduling