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.
@TcopRulz After performing this once, then you just pick the best combination in a sec.
e.g. say you have 1 machine and three jobs ABC... All permutetions are 3!=6. For each permutation you get a result say, the total time to perform all jobs.
e.g.
ABC = 2
ACB = 2,5
CBA = 1,8 etc
and do it for as much n!^m you probably will need.
Store them in an sql database and request the min time needed using a simple " Select min(TotalTime) From Permutations _table"
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?
Appreciate your effort!! the question at 7.00 was a very good question.Completing early does not always result in benefits,on the contrary it might increase the mean idle time of the machine if the downstream machine is still processing other products
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!
Comment removed
TcopRulz 2 months ago
Comment removed
TcopRulz 2 months ago
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.
TcopRulz 2 months ago
Comment removed
TcopRulz 2 months ago
Comment removed
TcopRulz 2 months ago
Comment removed
TcopRulz 2 months ago
This has been flagged as spam show
@TcopRulz After performing this once, then you just pick the best combination in a sec.
e.g. say you have 1 machine and three jobs ABC... All permutetions are 3!=6. For each permutation you get a result say, the total time to perform all jobs.
e.g.
ABC = 2
ACB = 2,5
CBA = 1,8 etc
and do it for as much n!^m you probably will need.
Store them in an sql database and request the min time needed using a simple " Select min(TotalTime) From Permutations _table"
TcopRulz 2 months ago
This has been flagged as spam show
@TcopRulz For faster results when calculating all permutations I used the Johnson–Trotter algorithm
TcopRulz 2 months ago
amazing....
I have come to this problems many times in past and i didn't even know there would be a lecture about them!
TcopRulz 2 months ago
Thanks for your sharing.
Knowledge has no border
nhatbook 8 months ago
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.
brujoezln 9 months ago
Thank you for all your lectures Sir. They are not only educative but very informative also.
ravsi72 10 months ago
This has been flagged as spam show
Appreciate your effort!! the question at 7.00 was a very good question.Completing early does not always result in benefits,on the contrary it might increase the mean idle time of the machine if the downstream machine is still processing other products
kaushiktvm 11 months ago
Comment removed
kaushiktvm 11 months ago
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!
0511rajiv 1 year ago