optmization of a scheduling problem in python












0















I am trying to learn on scheduling and have the following use case:
I have different parts that need to be delivered on specific dates, also they have different quantity and different runtimes. Only 1 machine is considered. The delivery date is a hard constraint, but I also would like to see if I can optimize the setup of the machine for each product. Therefore I have table with the different tools used for the parts. When the cell has a 0 the tool is not used, when there is a 1 the tool is used. I have around 50 tools in total for all parts. do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.



I was able to sort my data after the date, but do not know where I should start to go to optimize, which algorithm might be good, a genetic algorithm or ant colony optimization ? I can not provide a code yet and also do not want one whole code from here, but a good starting point is my interest.










share|improve this question

























  • Can you please provide more explanation what your goal is? What is your function that measures how good the "setup of the machine" is?

    – BurningKarl
    Nov 15 '18 at 18:26













  • Looking at your first problem, you described that there is just one machine that produces all the different parts. Because every part needs to be made at some time and you have given delivery dates, it seems obvious to queue the parts (with given quantities) in the order they are supposed to be delivered, assuming that the delivery dates are realistic deadlines.

    – BurningKarl
    Nov 15 '18 at 18:32











  • @BurningKarl in the first place there is one machine right. I do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.

    – utahpyml
    Nov 15 '18 at 18:41











  • @ErwinKalvelagen I found literature about the problem, but nothing really about the coding for my usecase.

    – utahpyml
    Nov 15 '18 at 18:43











  • This is called a machine scheduling problem with sequence dependent setup times. There is literature on this problem.

    – Erwin Kalvelagen
    Nov 15 '18 at 18:55
















0















I am trying to learn on scheduling and have the following use case:
I have different parts that need to be delivered on specific dates, also they have different quantity and different runtimes. Only 1 machine is considered. The delivery date is a hard constraint, but I also would like to see if I can optimize the setup of the machine for each product. Therefore I have table with the different tools used for the parts. When the cell has a 0 the tool is not used, when there is a 1 the tool is used. I have around 50 tools in total for all parts. do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.



I was able to sort my data after the date, but do not know where I should start to go to optimize, which algorithm might be good, a genetic algorithm or ant colony optimization ? I can not provide a code yet and also do not want one whole code from here, but a good starting point is my interest.










share|improve this question

























  • Can you please provide more explanation what your goal is? What is your function that measures how good the "setup of the machine" is?

    – BurningKarl
    Nov 15 '18 at 18:26













  • Looking at your first problem, you described that there is just one machine that produces all the different parts. Because every part needs to be made at some time and you have given delivery dates, it seems obvious to queue the parts (with given quantities) in the order they are supposed to be delivered, assuming that the delivery dates are realistic deadlines.

    – BurningKarl
    Nov 15 '18 at 18:32











  • @BurningKarl in the first place there is one machine right. I do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.

    – utahpyml
    Nov 15 '18 at 18:41











  • @ErwinKalvelagen I found literature about the problem, but nothing really about the coding for my usecase.

    – utahpyml
    Nov 15 '18 at 18:43











  • This is called a machine scheduling problem with sequence dependent setup times. There is literature on this problem.

    – Erwin Kalvelagen
    Nov 15 '18 at 18:55














0












0








0


1






I am trying to learn on scheduling and have the following use case:
I have different parts that need to be delivered on specific dates, also they have different quantity and different runtimes. Only 1 machine is considered. The delivery date is a hard constraint, but I also would like to see if I can optimize the setup of the machine for each product. Therefore I have table with the different tools used for the parts. When the cell has a 0 the tool is not used, when there is a 1 the tool is used. I have around 50 tools in total for all parts. do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.



I was able to sort my data after the date, but do not know where I should start to go to optimize, which algorithm might be good, a genetic algorithm or ant colony optimization ? I can not provide a code yet and also do not want one whole code from here, but a good starting point is my interest.










share|improve this question
















I am trying to learn on scheduling and have the following use case:
I have different parts that need to be delivered on specific dates, also they have different quantity and different runtimes. Only 1 machine is considered. The delivery date is a hard constraint, but I also would like to see if I can optimize the setup of the machine for each product. Therefore I have table with the different tools used for the parts. When the cell has a 0 the tool is not used, when there is a 1 the tool is used. I have around 50 tools in total for all parts. do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.



I was able to sort my data after the date, but do not know where I should start to go to optimize, which algorithm might be good, a genetic algorithm or ant colony optimization ? I can not provide a code yet and also do not want one whole code from here, but a good starting point is my interest.







python optimization genetic-algorithm ant-colony






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Nov 15 '18 at 18:43







utahpyml

















asked Nov 15 '18 at 17:44









utahpymlutahpyml

54




54













  • Can you please provide more explanation what your goal is? What is your function that measures how good the "setup of the machine" is?

    – BurningKarl
    Nov 15 '18 at 18:26













  • Looking at your first problem, you described that there is just one machine that produces all the different parts. Because every part needs to be made at some time and you have given delivery dates, it seems obvious to queue the parts (with given quantities) in the order they are supposed to be delivered, assuming that the delivery dates are realistic deadlines.

    – BurningKarl
    Nov 15 '18 at 18:32











  • @BurningKarl in the first place there is one machine right. I do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.

    – utahpyml
    Nov 15 '18 at 18:41











  • @ErwinKalvelagen I found literature about the problem, but nothing really about the coding for my usecase.

    – utahpyml
    Nov 15 '18 at 18:43











  • This is called a machine scheduling problem with sequence dependent setup times. There is literature on this problem.

    – Erwin Kalvelagen
    Nov 15 '18 at 18:55



















  • Can you please provide more explanation what your goal is? What is your function that measures how good the "setup of the machine" is?

    – BurningKarl
    Nov 15 '18 at 18:26













  • Looking at your first problem, you described that there is just one machine that produces all the different parts. Because every part needs to be made at some time and you have given delivery dates, it seems obvious to queue the parts (with given quantities) in the order they are supposed to be delivered, assuming that the delivery dates are realistic deadlines.

    – BurningKarl
    Nov 15 '18 at 18:32











  • @BurningKarl in the first place there is one machine right. I do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.

    – utahpyml
    Nov 15 '18 at 18:41











  • @ErwinKalvelagen I found literature about the problem, but nothing really about the coding for my usecase.

    – utahpyml
    Nov 15 '18 at 18:43











  • This is called a machine scheduling problem with sequence dependent setup times. There is literature on this problem.

    – Erwin Kalvelagen
    Nov 15 '18 at 18:55

















Can you please provide more explanation what your goal is? What is your function that measures how good the "setup of the machine" is?

– BurningKarl
Nov 15 '18 at 18:26







Can you please provide more explanation what your goal is? What is your function that measures how good the "setup of the machine" is?

– BurningKarl
Nov 15 '18 at 18:26















Looking at your first problem, you described that there is just one machine that produces all the different parts. Because every part needs to be made at some time and you have given delivery dates, it seems obvious to queue the parts (with given quantities) in the order they are supposed to be delivered, assuming that the delivery dates are realistic deadlines.

– BurningKarl
Nov 15 '18 at 18:32





Looking at your first problem, you described that there is just one machine that produces all the different parts. Because every part needs to be made at some time and you have given delivery dates, it seems obvious to queue the parts (with given quantities) in the order they are supposed to be delivered, assuming that the delivery dates are realistic deadlines.

– BurningKarl
Nov 15 '18 at 18:32













@BurningKarl in the first place there is one machine right. I do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.

– utahpyml
Nov 15 '18 at 18:41





@BurningKarl in the first place there is one machine right. I do not want to look only at the delivery dates, I also want to look how I can shorten time between the change from part A to part B, so that I do change as less as tools as possible.

– utahpyml
Nov 15 '18 at 18:41













@ErwinKalvelagen I found literature about the problem, but nothing really about the coding for my usecase.

– utahpyml
Nov 15 '18 at 18:43





@ErwinKalvelagen I found literature about the problem, but nothing really about the coding for my usecase.

– utahpyml
Nov 15 '18 at 18:43













This is called a machine scheduling problem with sequence dependent setup times. There is literature on this problem.

– Erwin Kalvelagen
Nov 15 '18 at 18:55





This is called a machine scheduling problem with sequence dependent setup times. There is literature on this problem.

– Erwin Kalvelagen
Nov 15 '18 at 18:55












0






active

oldest

votes











Your Answer






StackExchange.ifUsing("editor", function () {
StackExchange.using("externalEditor", function () {
StackExchange.using("snippets", function () {
StackExchange.snippets.init();
});
});
}, "code-snippets");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "1"
};
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
},
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fstackoverflow.com%2fquestions%2f53325170%2foptmization-of-a-scheduling-problem-in-python%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Stack Overflow!


  • 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.


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%2fstackoverflow.com%2fquestions%2f53325170%2foptmization-of-a-scheduling-problem-in-python%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

Xamarin.iOS Cant Deploy on Iphone

Glorious Revolution

Dulmage-Mendelsohn matrix decomposition in Python