Queueing Theory and Scheduling

  1. Parallel Machine Scheduling
    1. Identical Parallel Machines
      1. List Scheduling Algorithms
        1. Longest Processing Time (LPT)
          1. Shortest Processing Time (SPT)
            1. Performance Analysis
            2. Optimal Algorithms
              1. Dynamic Programming
                1. Integer Programming
              2. Uniform Parallel Machines
                1. Machine Speed Factors
                  1. Load Balancing
                    1. Approximation Algorithms
                    2. Unrelated Parallel Machines
                      1. Assignment Problem Formulation
                        1. Approximation Algorithms
                          1. Complexity Analysis

                        Previous

                        7. Single Machine Scheduling

                        Go to top

                        Next

                        9. Flow Shop and Job Shop Scheduling