Largest Candidate Rule
显示 更早的评论
I have to write a program for assembly line balancing utilizing the Largest Candidate rule. Basically that is taking a series of elements with an associated time, then reordering the elements in descending order by time, ie the longest time first. Then I must group the elements into work stations by observing other constraints. Any suggestions. I am still pretty new to Matlab so my knowledge is still pretty basic.
I am having a hard time visualizing how to group the elements into work stations. There is a time cycle which the sum of the time of the grouped elements cannot exceed. There are also precedence factors which dictate which station certain elements can be in. I just cannot figure out how to account for all of it. It seems to me there would be an overwhelming amount of "if" statements in this code.
采纳的回答
更多回答(0 个)
类别
在 帮助中心 和 File Exchange 中查找有关 Creating and Concatenating Matrices 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!