Distributing objects on containers












0












$begingroup$


Suppose we have $n$ containers, each has the ability of holding $f_{i}$ object for $i=1, 2, dots, n$. That means $f_{i}$ is the maximum number of object that the $i$th container can hold.



Now, we have $N$ objects in total. We assume that $displaystyle sum_{i=1}^{n} f_{i} > N$ such that all $N$ objects can actually be filled into the containers.



Question:
How to distribute these objects to the containers such that each container would not reach to its upper limit too quickly?



If $f_{i} equiv f$ for all $i$, then my intuition told me that the $N$ objects must be uniformly distributed to the containers. (seems related to entropy). But what if all $f_{i}$ are different? What is the objective function?






optimization entropy







share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    Suppose we have $n$ containers, each has the ability of holding $f_{i}$ object for $i=1, 2, dots, n$. That means $f_{i}$ is the maximum number of object that the $i$th container can hold.



    Now, we have $N$ objects in total. We assume that $displaystyle sum_{i=1}^{n} f_{i} > N$ such that all $N$ objects can actually be filled into the containers.



    Question:
    How to distribute these objects to the containers such that each container would not reach to its upper limit too quickly?



    If $f_{i} equiv f$ for all $i$, then my intuition told me that the $N$ objects must be uniformly distributed to the containers. (seems related to entropy). But what if all $f_{i}$ are different? What is the objective function?






    optimization entropy







    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      Suppose we have $n$ containers, each has the ability of holding $f_{i}$ object for $i=1, 2, dots, n$. That means $f_{i}$ is the maximum number of object that the $i$th container can hold.



      Now, we have $N$ objects in total. We assume that $displaystyle sum_{i=1}^{n} f_{i} > N$ such that all $N$ objects can actually be filled into the containers.



      Question:
      How to distribute these objects to the containers such that each container would not reach to its upper limit too quickly?



      If $f_{i} equiv f$ for all $i$, then my intuition told me that the $N$ objects must be uniformly distributed to the containers. (seems related to entropy). But what if all $f_{i}$ are different? What is the objective function?






      optimization entropy







      share|cite|improve this question











      $endgroup$




      Suppose we have $n$ containers, each has the ability of holding $f_{i}$ object for $i=1, 2, dots, n$. That means $f_{i}$ is the maximum number of object that the $i$th container can hold.



      Now, we have $N$ objects in total. We assume that $displaystyle sum_{i=1}^{n} f_{i} > N$ such that all $N$ objects can actually be filled into the containers.



      Question:
      How to distribute these objects to the containers such that each container would not reach to its upper limit too quickly?



      If $f_{i} equiv f$ for all $i$, then my intuition told me that the $N$ objects must be uniformly distributed to the containers. (seems related to entropy). But what if all $f_{i}$ are different? What is the objective function?






      optimization entropy




      optimization entropy






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Jan 9 at 6:39







      K_inverse

















      asked Jan 9 at 6:22









      K_inverseK_inverse

      273213




      273213






















          1 Answer
          1






          active

          oldest

          votes


















          2












          $begingroup$

          If you want to maximize the time until any bin reaches its maximum limit.



          At any moment of time, when we want to insert an object, look for a bin with at least $2$ slots left.



          That way, if $Nle sum_{i=1}^nf_i-n-1$, the upper limit for every bin is not attained.



          If $N ge sum_{i=1}^nf_i-n$, then we don't have a choice but let one of the bin attain the maximum.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            How did you obtain the inequality constraint?
            $endgroup$
            – K_inverse
            Jan 9 at 7:40










          • $begingroup$
            Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 8:02










          • $begingroup$
            Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
            $endgroup$
            – K_inverse
            Jan 9 at 11:45












          • $begingroup$
            would have enough buffer? is it that some objects must go to certain bins only?
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 12:28










          • $begingroup$
            well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
            $endgroup$
            – K_inverse
            Jan 9 at 12:43











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067149%2fdistributing-objects-on-containers%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          2












          $begingroup$

          If you want to maximize the time until any bin reaches its maximum limit.



          At any moment of time, when we want to insert an object, look for a bin with at least $2$ slots left.



          That way, if $Nle sum_{i=1}^nf_i-n-1$, the upper limit for every bin is not attained.



          If $N ge sum_{i=1}^nf_i-n$, then we don't have a choice but let one of the bin attain the maximum.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            How did you obtain the inequality constraint?
            $endgroup$
            – K_inverse
            Jan 9 at 7:40










          • $begingroup$
            Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 8:02










          • $begingroup$
            Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
            $endgroup$
            – K_inverse
            Jan 9 at 11:45












          • $begingroup$
            would have enough buffer? is it that some objects must go to certain bins only?
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 12:28










          • $begingroup$
            well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
            $endgroup$
            – K_inverse
            Jan 9 at 12:43
















          2












          $begingroup$

          If you want to maximize the time until any bin reaches its maximum limit.



          At any moment of time, when we want to insert an object, look for a bin with at least $2$ slots left.



          That way, if $Nle sum_{i=1}^nf_i-n-1$, the upper limit for every bin is not attained.



          If $N ge sum_{i=1}^nf_i-n$, then we don't have a choice but let one of the bin attain the maximum.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            How did you obtain the inequality constraint?
            $endgroup$
            – K_inverse
            Jan 9 at 7:40










          • $begingroup$
            Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 8:02










          • $begingroup$
            Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
            $endgroup$
            – K_inverse
            Jan 9 at 11:45












          • $begingroup$
            would have enough buffer? is it that some objects must go to certain bins only?
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 12:28










          • $begingroup$
            well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
            $endgroup$
            – K_inverse
            Jan 9 at 12:43














          2












          2








          2





          $begingroup$

          If you want to maximize the time until any bin reaches its maximum limit.



          At any moment of time, when we want to insert an object, look for a bin with at least $2$ slots left.



          That way, if $Nle sum_{i=1}^nf_i-n-1$, the upper limit for every bin is not attained.



          If $N ge sum_{i=1}^nf_i-n$, then we don't have a choice but let one of the bin attain the maximum.






          share|cite|improve this answer









          $endgroup$



          If you want to maximize the time until any bin reaches its maximum limit.



          At any moment of time, when we want to insert an object, look for a bin with at least $2$ slots left.



          That way, if $Nle sum_{i=1}^nf_i-n-1$, the upper limit for every bin is not attained.



          If $N ge sum_{i=1}^nf_i-n$, then we don't have a choice but let one of the bin attain the maximum.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Jan 9 at 7:09









          Siong Thye GohSiong Thye Goh

          100k1465117




          100k1465117












          • $begingroup$
            How did you obtain the inequality constraint?
            $endgroup$
            – K_inverse
            Jan 9 at 7:40










          • $begingroup$
            Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 8:02










          • $begingroup$
            Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
            $endgroup$
            – K_inverse
            Jan 9 at 11:45












          • $begingroup$
            would have enough buffer? is it that some objects must go to certain bins only?
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 12:28










          • $begingroup$
            well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
            $endgroup$
            – K_inverse
            Jan 9 at 12:43


















          • $begingroup$
            How did you obtain the inequality constraint?
            $endgroup$
            – K_inverse
            Jan 9 at 7:40










          • $begingroup$
            Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 8:02










          • $begingroup$
            Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
            $endgroup$
            – K_inverse
            Jan 9 at 11:45












          • $begingroup$
            would have enough buffer? is it that some objects must go to certain bins only?
            $endgroup$
            – Siong Thye Goh
            Jan 9 at 12:28










          • $begingroup$
            well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
            $endgroup$
            – K_inverse
            Jan 9 at 12:43
















          $begingroup$
          How did you obtain the inequality constraint?
          $endgroup$
          – K_inverse
          Jan 9 at 7:40




          $begingroup$
          How did you obtain the inequality constraint?
          $endgroup$
          – K_inverse
          Jan 9 at 7:40












          $begingroup$
          Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
          $endgroup$
          – Siong Thye Goh
          Jan 9 at 8:02




          $begingroup$
          Intuitively, when we have too many objects, we have no choice but to hit an upper limit. Now, the question is what is having too many objects. My proposed strategy is to avoid hitting any upper limit whenever we can. The first moment when we can't avoid is when every bins has exactly $1$ slot left. Total number of slots is $sum_{i=1}^n f_i$, and the number of bins is $n$.
          $endgroup$
          – Siong Thye Goh
          Jan 9 at 8:02












          $begingroup$
          Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
          $endgroup$
          – K_inverse
          Jan 9 at 11:45






          $begingroup$
          Thanks. Apart from just avoiding hitting the upper limit, I would like to distribute the objects such that every containers would have enough buffer. Not sure what are the keys word to search for this problem. My feeling is that it is related to entropy, but I am not sure.
          $endgroup$
          – K_inverse
          Jan 9 at 11:45














          $begingroup$
          would have enough buffer? is it that some objects must go to certain bins only?
          $endgroup$
          – Siong Thye Goh
          Jan 9 at 12:28




          $begingroup$
          would have enough buffer? is it that some objects must go to certain bins only?
          $endgroup$
          – Siong Thye Goh
          Jan 9 at 12:28












          $begingroup$
          well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
          $endgroup$
          – K_inverse
          Jan 9 at 12:43




          $begingroup$
          well yes, there are some constraints on what are the available containers for each object. But I tried to ignore these constraints first for simplicity.
          $endgroup$
          – K_inverse
          Jan 9 at 12:43


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid …



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3067149%2fdistributing-objects-on-containers%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          -

          Popular posts from this blog

          Mario Kart Wii

          Image
          Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! Mario Kart Wii From The Cutting Room Floor Jump to: navigation, search Mario Kart Wii Developer : Nintendo Publisher : Nintendo Platform : Wii Released in JP : April 10, 2008 Released in US : April 27, 2008 Released in EU : April 11, 2008 Released in AU : April 24, 2008 Released in KR : April 30, 2009 This game has unused animations. This game has unused areas. This game has unused code. This game has unused objects. This game has unused modes / minigames. This game has unused graphics. This game has unused models. This game has unused items. This game has unused music. This game has regional differences. This game has a notes page This game has a prerelease article Mario Kart Wii is the sixth game in the series (not counting Arcade editions), which intro...
          Read more

          The Binding of Isaac: Rebirth/Afterbirth

          Image
          Please consider supporting The Cutting Room Floor on Patreon. Thanks for all your support! The Binding of Isaac: Rebirth/Afterbirth From The Cutting Room Floor < The Binding of Isaac: Rebirth Jump to: navigation, search This is a sub-page of The Binding of Isaac: Rebirth . Afterbirth is the first expansion pack for Rebirth and features a variety of improvements. Contents 1 Unused Graphics 1.1 Old Man Keeper 1.2 Skinless Hush 1.3 Miscellaneous Unused Hush Sprites 1.4 Generosity achievement 1.5 Afterbirth+ Room Editor 1.6 Bearded Ultra Greed 1.7 Early Ultra Greed 1.8 Unused Brownie Expression 1.9 Frail's Spinning Head 1.10 Mom's Dead Hand Alt 2 Unused Audio 2.1 Unused Dead Womb Layer 2.2 Unused Hush Battle Outro 2.3 The Stain Grunt Unused Graphics Old Man Keeper Image file: gfxuimain me...
          Read more

          What does “Dominus providebit” mean?

          Image
          5 Does "Dominus providebit" mean "The Lord will provide" or "The Lord provides"? I once had a bit of an argument with a guy who studied Latin over that. It's an inscription that appears on the rim of some old Swiss coins that I have. meaning latin-to-english-translation grammar-identification share | improve this question edited Jan 18 at 15:27 V2Blast 105 4 asked Jan 17 at 22:49 Donald K. Donald K. 26 1 ...
          Read more