Practical production scheduling at big factory

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
0
down vote

favorite












At this big factory:



$3$ production lines:Line$_1$,Line$_2$,Line$_3$;



$10$ products: $p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10$;



Each production line can produce each of the products, but each product still is recommended to should be produced on certain special line;
the time of producing one of some product is invariable;
each product line runs all the time;
switch from producing one product to another on production line would waste extra time;



Now I receive many orders which record information as below:
enter image description here



Now I treat them as below:



  1. merge the orders which have the same product name and deadline;

  2. for deadline day, I range all the orders on the recommended lines;

  3. if the recommended lines are not enough then switch to other free lines;

  4. if all the lines on the current day are not enough, then switch to lines of the next day;

  5. if all the products were arranged on the current day and still some of lines are a little free, then these free lines would be arranged to produce products of next day(then next next day);

I have coded according to above steps but I still think maybe there is some system method for this problem; I guess maybe I should use linear programming, but I don't know how since lack of these experience;



so shall I get some advice for resolving this problem or some demo/examples materials for similar problems?



thanks a lot!







share|cite|improve this question





















  • Please use MathJax to format. This makes your post easier to read.
    – MalayTheDynamo
    Jul 26 at 9:31










  • @MalayTheDynamo Are you suggesting they remake the table? Right now the non MathJax text matches the table's convention and isn't very hard to parse.
    – Mark S.
    Jul 26 at 9:53










  • @MarkS. Not the table. The text. $textLine_1$ would be better than line_1. As would $p_1$.
    – MalayTheDynamo
    Jul 26 at 9:55











  • But then it wouldn't match the table, is my point.
    – Mark S.
    Jul 26 at 9:55














up vote
0
down vote

favorite












At this big factory:



$3$ production lines:Line$_1$,Line$_2$,Line$_3$;



$10$ products: $p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10$;



Each production line can produce each of the products, but each product still is recommended to should be produced on certain special line;
the time of producing one of some product is invariable;
each product line runs all the time;
switch from producing one product to another on production line would waste extra time;



Now I receive many orders which record information as below:
enter image description here



Now I treat them as below:



  1. merge the orders which have the same product name and deadline;

  2. for deadline day, I range all the orders on the recommended lines;

  3. if the recommended lines are not enough then switch to other free lines;

  4. if all the lines on the current day are not enough, then switch to lines of the next day;

  5. if all the products were arranged on the current day and still some of lines are a little free, then these free lines would be arranged to produce products of next day(then next next day);

I have coded according to above steps but I still think maybe there is some system method for this problem; I guess maybe I should use linear programming, but I don't know how since lack of these experience;



so shall I get some advice for resolving this problem or some demo/examples materials for similar problems?



thanks a lot!







share|cite|improve this question





















  • Please use MathJax to format. This makes your post easier to read.
    – MalayTheDynamo
    Jul 26 at 9:31










  • @MalayTheDynamo Are you suggesting they remake the table? Right now the non MathJax text matches the table's convention and isn't very hard to parse.
    – Mark S.
    Jul 26 at 9:53










  • @MarkS. Not the table. The text. $textLine_1$ would be better than line_1. As would $p_1$.
    – MalayTheDynamo
    Jul 26 at 9:55











  • But then it wouldn't match the table, is my point.
    – Mark S.
    Jul 26 at 9:55












up vote
0
down vote

favorite









up vote
0
down vote

favorite











At this big factory:



$3$ production lines:Line$_1$,Line$_2$,Line$_3$;



$10$ products: $p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10$;



Each production line can produce each of the products, but each product still is recommended to should be produced on certain special line;
the time of producing one of some product is invariable;
each product line runs all the time;
switch from producing one product to another on production line would waste extra time;



Now I receive many orders which record information as below:
enter image description here



Now I treat them as below:



  1. merge the orders which have the same product name and deadline;

  2. for deadline day, I range all the orders on the recommended lines;

  3. if the recommended lines are not enough then switch to other free lines;

  4. if all the lines on the current day are not enough, then switch to lines of the next day;

  5. if all the products were arranged on the current day and still some of lines are a little free, then these free lines would be arranged to produce products of next day(then next next day);

I have coded according to above steps but I still think maybe there is some system method for this problem; I guess maybe I should use linear programming, but I don't know how since lack of these experience;



so shall I get some advice for resolving this problem or some demo/examples materials for similar problems?



thanks a lot!







share|cite|improve this question













At this big factory:



$3$ production lines:Line$_1$,Line$_2$,Line$_3$;



$10$ products: $p_1,p_2,p_3,p_4,p_5,p_6,p_7,p_8,p_9,p_10$;



Each production line can produce each of the products, but each product still is recommended to should be produced on certain special line;
the time of producing one of some product is invariable;
each product line runs all the time;
switch from producing one product to another on production line would waste extra time;



Now I receive many orders which record information as below:
enter image description here



Now I treat them as below:



  1. merge the orders which have the same product name and deadline;

  2. for deadline day, I range all the orders on the recommended lines;

  3. if the recommended lines are not enough then switch to other free lines;

  4. if all the lines on the current day are not enough, then switch to lines of the next day;

  5. if all the products were arranged on the current day and still some of lines are a little free, then these free lines would be arranged to produce products of next day(then next next day);

I have coded according to above steps but I still think maybe there is some system method for this problem; I guess maybe I should use linear programming, but I don't know how since lack of these experience;



so shall I get some advice for resolving this problem or some demo/examples materials for similar problems?



thanks a lot!









share|cite|improve this question












share|cite|improve this question




share|cite|improve this question








edited Jul 26 at 10:25









Kenta S

1,1371418




1,1371418









asked Jul 26 at 9:30









vx2008

11




11











  • Please use MathJax to format. This makes your post easier to read.
    – MalayTheDynamo
    Jul 26 at 9:31










  • @MalayTheDynamo Are you suggesting they remake the table? Right now the non MathJax text matches the table's convention and isn't very hard to parse.
    – Mark S.
    Jul 26 at 9:53










  • @MarkS. Not the table. The text. $textLine_1$ would be better than line_1. As would $p_1$.
    – MalayTheDynamo
    Jul 26 at 9:55











  • But then it wouldn't match the table, is my point.
    – Mark S.
    Jul 26 at 9:55
















  • Please use MathJax to format. This makes your post easier to read.
    – MalayTheDynamo
    Jul 26 at 9:31










  • @MalayTheDynamo Are you suggesting they remake the table? Right now the non MathJax text matches the table's convention and isn't very hard to parse.
    – Mark S.
    Jul 26 at 9:53










  • @MarkS. Not the table. The text. $textLine_1$ would be better than line_1. As would $p_1$.
    – MalayTheDynamo
    Jul 26 at 9:55











  • But then it wouldn't match the table, is my point.
    – Mark S.
    Jul 26 at 9:55















Please use MathJax to format. This makes your post easier to read.
– MalayTheDynamo
Jul 26 at 9:31




Please use MathJax to format. This makes your post easier to read.
– MalayTheDynamo
Jul 26 at 9:31












@MalayTheDynamo Are you suggesting they remake the table? Right now the non MathJax text matches the table's convention and isn't very hard to parse.
– Mark S.
Jul 26 at 9:53




@MalayTheDynamo Are you suggesting they remake the table? Right now the non MathJax text matches the table's convention and isn't very hard to parse.
– Mark S.
Jul 26 at 9:53












@MarkS. Not the table. The text. $textLine_1$ would be better than line_1. As would $p_1$.
– MalayTheDynamo
Jul 26 at 9:55





@MarkS. Not the table. The text. $textLine_1$ would be better than line_1. As would $p_1$.
– MalayTheDynamo
Jul 26 at 9:55













But then it wouldn't match the table, is my point.
– Mark S.
Jul 26 at 9:55




But then it wouldn't match the table, is my point.
– Mark S.
Jul 26 at 9:55















active

oldest

votes











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',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
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%2f2863243%2fpractical-production-scheduling-at-big-factory%23new-answer', 'question_page');

);

Post as a guest



































active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes










 

draft saved


draft discarded


























 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2863243%2fpractical-production-scheduling-at-big-factory%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What is the equation of a 3D cone with generalised tilt?

Color the edges and diagonals of a regular polygon

Relationship between determinant of matrix and determinant of adjoint?