Abstract: This study addresses an energy-efficient multiobjective distributed assembly permutation flowshop scheduling problem with sequence dependent setup time. The objectives are to minimize the ...
We consider producing permutations and combinations in lexicographical order. Except for the array that holds the combinatorial object, we require only O(1) extra storage. The production of the next ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results