Lecture - 41 Scheduling of Job Shops

แชร์
ฝัง
  • เผยแพร่เมื่อ 4 ส.ค. 2024
  • Lecture series on Project and Production Management by Prof. Arun kanda, Department of Mechanical Engineering, IIT Delhi. For more details on NPTEL visit nptel.iitm.ac.in

ความคิดเห็น • 7

  • @ravsi72
    @ravsi72 13 ปีที่แล้ว +1

    Thank you for all your lectures Sir. They are not only educative but very informative also.

  • @pargyropoulos
    @pargyropoulos 12 ปีที่แล้ว

    amazing....
    I have come to this problems many times in past and i didn't even know there would be a lecture about them!

  • @nhatbook
    @nhatbook 13 ปีที่แล้ว +1

    Thanks for your sharing.
    Knowledge has no border

  • @0511rajiv
    @0511rajiv 14 ปีที่แล้ว +1

    Very Best! Just to say, if you make N/1 flow shop interactive like other 2, it will be more helpful for person like me who has no background of the subject. I guess that was the reason of no appreciative comment yet for such a valuable asset and effort.
    I see your all videos and I am very big fan of you. God Bless You!

  • @brujoezln
    @brujoezln 13 ปีที่แล้ว

    Hello,
    first I would like to thank and congratulate you for explaining and sharing this class, it was very helpful. I got a specific question: (at time 1:00:18 in the video) you mention simulation to pick a certain rule for scheduling in more complex scenarios.
    what software or programs can be used to simulate this choosing rule stage?
    Greetings from Mexico.

  • @pargyropoulos
    @pargyropoulos 12 ปีที่แล้ว

    only one objection...
    It's true that is quite time consuming to calcute all different combinations/permutations but there is a shorter way out.What I did to resolve it, instead of using heuristics, was to precalculate the different combimations and store them in a database. Then, instead of calculating the optimum routing sequence "on the fly", you can just find it using a fast sql querry.The PC used was a 2006 model and needed about a day to give from (2!)^2 to (4!)^20 permutations using VB6.