![]() $D_p$: The length of time for paper $p$ to be completed. I don't know whether to consider time $t$ as a parameter for these variables or as its own variable and this is what I'm mainly struggling with. I have defined the following variables but am not sure if these are good or not. ![]() It has been some time since I've properly done LP so I am rusty(I'm also still a student so my skills were never good to begin with). This constraint is meant to represent a physical limitation we have at our facility. Movers cannot move papers for writers that are within 2 writers of each other at the same time (If writer 3 has completed his paper and a mover begins moving a paper for them, then writers 1,2,4, and 5 will have to wait until the mover for writer 3 has finished their move). ![]() Each mover takes 25 minutes to move a paper for the writer.How many movers are available to move papers at the same time.How many writers we have to write papers at the same time.The goal of this problem will be to minimize the total length of time it takes to write all of these papers with my staff. For the sake of simplicity, I am assuming that the time to take a completed paper and deliver a new one is constant for each move. We have 25 movers, whose responsibility it is to take the completed papers and go and grab a new paper for the writers to work on. We have 150 writers, whose responsibility it is to actually write the paper. We have 2 types of workers available to complete this set of papers. Each paper takes a different amount of time to complete. (All writers can write these papers and can all work at the same time). To keep the information confidential, I will refer to my tasks as papers that need to be written. I am trying to formulate a problem that will spit out an optimal schedule for my tasks to be completed.
0 Comments
Leave a Reply. |