Permutation and Combination Libraries

New Post: Generate salesman and job combinations

rpprasanth — Thu, 15 Oct 2009 07:44:01 GMT

Hi, I am working on sql server 2005.

Basic story: When a customer call to a call center and say he has a problem in assembling the computer and so required a Technician to fix the problem.
The call center guy fix a job taking details of customer like Customer name, address, Zip code, Region and If he require a Skill Tech, Certified Tech, any particular date and time to repair

So need to check who all the available technicians who are exactly suit to customer requirement..

so the call center guy will get a list of technicians who are available close in distance to the customer location
and the tech timings has to be available to fix that problem means he should be free at that customer chosen time or has schedule to any another customer. If so another tech has to be schedule for this job.

And so the Tech will be scheduled and appointment will be fixed.

Let us Suppose another job has come
which is more near to that customer, then we need to reschedule the tech to this job if all the requirement is ok, and more near to this new job
with same skills, certificate requirement of tech has to be allocated to the previous job.. which means we are rescheduling jobs when and every new job will arrive..

so all time all the techs has to be checked if they need to reschedule.
distance should be calculated based on latitude and longitude, distance should be between customer(job) and Tech.
how the sequence generation should be followd. pls trow light and could suggest me a better idea for approach it would be more helpful.

Bottom line of my Problem:
Compare all possible sequences to which we can assign job to Technicians available.
this should be done in sql server as per requirement. pls help.

New Post: combinations

rac — Wed, 30 Sep 2009 17:24:05 GMT

ok, empty set is 32nd combination, so number "31" in output is correct, then what about duplications?

New Post: combinations

rac — Wed, 30 Sep 2009 17:22:02 GMT

I don't understand it:

In the last example we have 5 element set. We create all possible combinations,

output is:

        31
        A
        B
        C
        D
        E
        E
        A B
        A C
        A D
        A E
        B C
        B D
        B E
        C D
        C E
        D E
        D E
        A B C
        A B D
        A B E
        A C D
        A C E
        A D E
        B C D
        B C E
        B D E
        C D E
        C D E
        A B C D
        A B C E
        A B D E
        A C D E
        B C D E
        B C D E
        A B C D E
        */

I think there should be exactly 32 combinations (as 2^5=32).
Some of combinations are duplicated, for example:

B C D E
B C D E

Source code checked in, #13560

dustinandrews — Sat, 25 Oct 2008 00:41:21 GMT

Fixes to example code. Moved exceptions into a deeper name space to make the generated docs cleaner. Updated help. Fixed /// documentation problems where < notation was required.

Source code checked in, #13552

dustinandrews — Fri, 24 Oct 2008 21:33:17 GMT

Initial upload