SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SETUP TIMES
Budget: $15 – $25 USD
I am looking for an experienced programmer to help me with a single machine scheduling problem with sequence-dependent setup times. The objective is to maximize throughput. For this project, we are looking for someone who can come up with a solution using a Branch and Bound algorithm. Specifically, the sequence-dependent setup times would be the time taken to change from one job to another.
We need someone with the right skillset and experience to help us create a solution that meets our objectives. The successful candidate should possess excellent knowledge of programming, linear programming, and dynamic programming. Previous experience with scheduling algorithms would also be extremely beneficial.
The goal is to create an efficient algorithm to optimize our machine scheduling. We hope to find a creative problem solver who can come up with innovative solutions to suit our needs. We understand this is an ambitious challenge and will reward the right person adequately.
Please get in touch to discuss further and submit your proposal today. Thank you.
We need someone with the right skillset and experience to help us create a solution that meets our objectives. The successful candidate should possess excellent knowledge of programming, linear programming, and dynamic programming. Previous experience with scheduling algorithms would also be extremely beneficial.
The goal is to create an efficient algorithm to optimize our machine scheduling. We hope to find a creative problem solver who can come up with innovative solutions to suit our needs. We understand this is an ambitious challenge and will reward the right person adequately.
Please get in touch to discuss further and submit your proposal today. Thank you.