'Scheduling with Startup and Holding Costs' Video Lecture

Scheduling with Startup and Holding Costs

  • Course: Design and Analysis of Algorithms
  • Discipline: Computer Science and Engineering
  • Faculty: Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade
  • Institute: IIT Bombay

    • Scheduling with Startup and Holding Costs - Click on the Video Link shown below to play the video on Youtube. Browse through Design and Analysis of Algorithms (Computer Science and Engineering) Video Lectures by Prof. Sundar Viswanathan, Prof. Ajit A Diwan, Prof. Abhiram G Ranade from IIT Bombay through NPTEL.

    NEXT LECTURE >> Average case Analysis of Quicksort
    Download this video in MP4, FLV & 3GP formats
    Format  Size  Download
    MP4 251 MB MP4 Video Download Link 1
    MP4 251 MB MP4 Video Download Link 2
    FLV 123 MB FLV Video Download Link 1
    FLV 123 MB FLV Video Download Link 2
    3gp 58 MB 3gp Video Download Link 1
    3gp 58 MB 3gp Video Download Link 2
    Search Courses
    Course Video Lectures Overview of the course Framework for Algorithms Analysis Algorithms Analysis Framework - II Asymptotic Notations Algorithm Design Techniques : Basics Divide And Conquer-I Divide And Conquer -II Median Finding Divide And Conquer -III Surfing Lower Bounds Divide And Conquer -IV Closest Pair Greedy Algorithms -I Greedy Algorithms - II Greedy Algorithms - III Greedy Algorithms - IV Pattern Matching - I Pattern Matching - II Combinational Search and Optimization I Combinational Search and Optimization II Dynamic Programming Longest Common Subsequences Matrix Chain Multiplication Scheduling with Startup and Holding Costs Average case Analysis of Quicksort Bipartite Maximum Matching Lower Bounds for Sorting Element Distinctness Lower Bounds NP-Completeness-I -Motivation NP - Completeness - II NP-Completeness - III NP-Completeness - IV NP-Completeness - V NP-Completeness - VI Approximation Algorithms Approximation Algorithms Approximation Algorithms for NP
    2015. EngineeringVideoLectures.com