{"id":12443,"date":"2022-09-30T19:18:42","date_gmt":"2022-09-30T13:48:42","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/"},"modified":"2022-09-30T19:18:42","modified_gmt":"2022-09-30T13:48:42","slug":"solved-c-logic-approach-to-dispatch-efficiency-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/","title":{"rendered":"[Solved] c# logic approach to dispatch efficiency [closed]"},"content":{"rendered":"<p> [ad_1]<br \/>\n<\/p>\n<div id=\"answer-18852090\" class=\"answer js-answer accepted-answer js-accepted-answer\" data-answerid=\"18852090\" data-parentid=\"18848829\" data-score=\"0\" data-position-on-page=\"1\" data-highest-scored=\"1\" data-question-has-accepted-highest-score=\"1\" itemprop=\"acceptedAnswer\" itemscope itemtype=\"https:\/\/schema.org\/Answer\">\n<div class=\"post-layout\">\n<div class=\"votecell post-layout--left\"><\/div>\n<div class=\"answercell post-layout--right\">\n<div class=\"s-prose js-post-body\" itemprop=\"text\">\n<p>If you are allowed to use external libraries (I assume some homework assignment) you should use the Combinatorics library (via NuGet). If not, do the combinatoric stuff yourself \ud83d\ude09<\/p>\n<p>The idea:<br \/>\nYou need all possible (non repeating) combinations of cars and zones to find the combination(s) that gets the most jobs done. Using <code>Variations<\/code> from the above lib, you already gives you this kind of two-dimensional assigment, because you get a value that has an index.<br \/>\nPlease be aware that I&#8217;m not a C# guy, but prefer VB &#8230;<\/p>\n<pre><code>private string[] jobs = { \"Zone 2\", \"Zone 4\", \"Zone 45\" };\n    private string[] cars = {\"Frank\", \"John\", \"Mary\"};\n\n    private void CheckJobs(){\n\n        var k = new Combinatorics.Collections.Variations&lt;string&gt;(jobs.ToList(),3);\n        foreach (var c in k)\n        {\n            int count = 0;\n            for (int i = 0; i &lt; 3; i++)\n            {\n                if(IsPossible(cars[i],c[i])) count++;\n                Console.Write(\"Driver {0} takes {1}   \", cars[i], c[i]);\n            }\n            Console.WriteLine(\"Jobs done = {0}\", count);\n        }\n    }\n\n    private Boolean IsPossible(string car, string job)\n    {\n        if (car == \"Mary\") {\n            return (job == \"Zone 2\");\n        }\n        return true;\n    }\n\n    private void button1_Click(object sender, EventArgs e)\n    {\n        CheckJobs();\n    }\n<\/code><\/pre>\n<p>You can either use all combinations of cars OR jobs. This might be helpfull in cases where you have either more cars or jobs. If for example you have more cars than jobs, you create all variations of cars with a length equal to the number of jobs.<br \/>\nThe only thing have to do else, is to simply select the Variations that have the highest number of jobs done (or whatever function you might want to use to measure &#8220;efficiency&#8221;.<\/p>\n<\/p><\/div>\n<div class=\"mt24\"><\/div>\n<\/div>\n<p>            <span class=\"d-none\" itemprop=\"commentCount\"><\/span> <\/p><\/div>\n<\/div>\n<p>[ad_2]<\/p>\n<p>solved c# logic approach to dispatch efficiency [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"<p>[ad_1] If you are allowed to use external libraries (I assume some homework assignment) you should use the Combinatorics library (via NuGet). If not, do the combinatoric stuff yourself \ud83d\ude09 The idea: You need all possible (non repeating) combinations of cars and zones to find the combination(s) that gets the most jobs done. Using Variations &#8230; <a title=\"[Solved] c# logic approach to dispatch efficiency [closed]\" class=\"read-more\" href=\"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/\" aria-label=\"More on [Solved] c# logic approach to dispatch efficiency [closed]\">Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[324,529],"class_list":["post-12443","post","type-post","status-publish","format-standard","hentry","category-solved","tag-c","tag-logic"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.4 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>[Solved] c# logic approach to dispatch efficiency [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] c# logic approach to dispatch efficiency [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] If you are allowed to use external libraries (I assume some homework assignment) you should use the Combinatorics library (via NuGet). If not, do the combinatoric stuff yourself \ud83d\ude09 The idea: You need all possible (non repeating) combinations of cars and zones to find the combination(s) that gets the most jobs done. Using Variations ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2022-09-30T13:48:42+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minute\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/person\\\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] c# logic approach to dispatch efficiency [closed]\",\"datePublished\":\"2022-09-30T13:48:42+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/\"},\"wordCount\":186,\"publisher\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\"},\"keywords\":[\"c++\",\"logic\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/\",\"name\":\"[Solved] c# logic approach to dispatch efficiency [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#website\"},\"datePublished\":\"2022-09-30T13:48:42+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-c-logic-approach-to-dispatch-efficiency-closed\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] c# logic approach to dispatch efficiency [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#website\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/jassweb.com\\\/wp-content\\\/uploads\\\/2021\\\/02\\\/jass-website-logo-1.png\",\"contentUrl\":\"https:\\\/\\\/jassweb.com\\\/wp-content\\\/uploads\\\/2021\\\/02\\\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/logo\\\/image\\\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/person\\\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400\",\"contentUrl\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\\\/\\\/jassweb.com\"],\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/author\\\/jaspritsinghghumangmail-com\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] c# logic approach to dispatch efficiency [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] c# logic approach to dispatch efficiency [closed] - JassWeb","og_description":"[ad_1] If you are allowed to use external libraries (I assume some homework assignment) you should use the Combinatorics library (via NuGet). If not, do the combinatoric stuff yourself \ud83d\ude09 The idea: You need all possible (non repeating) combinations of cars and zones to find the combination(s) that gets the most jobs done. Using Variations ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/","og_site_name":"JassWeb","article_published_time":"2022-09-30T13:48:42+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"1 minute"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] c# logic approach to dispatch efficiency [closed]","datePublished":"2022-09-30T13:48:42+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/"},"wordCount":186,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["c++","logic"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/","name":"[Solved] c# logic approach to dispatch efficiency [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2022-09-30T13:48:42+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-c-logic-approach-to-dispatch-efficiency-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] c# logic approach to dispatch efficiency [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/12443","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=12443"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/12443\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=12443"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=12443"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=12443"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}