Queueing Theory and Scheduling

  1. Flow Shop and Job Shop Scheduling
    1. Flow Shop Scheduling
      1. Two-Machine Flow Shop
        1. Johnson's Algorithm
          1. Optimality Proof
          2. Three-Machine Flow Shop
            1. Heuristic Methods
              1. Complexity Results
              2. General Flow Shop
                1. NEH Heuristic
                  1. Branch and Bound
                    1. Metaheuristics
                  2. Job Shop Scheduling
                    1. Problem Formulation
                      1. Disjunctive Graph Model
                        1. Critical Path Analysis
                          1. Shifting Bottleneck Heuristic
                            1. Branch and Bound Methods
                              1. Local Search Methods

                            Previous

                            8. Parallel Machine Scheduling

                            Go to top

                            Next

                            10. Real-Time Scheduling