Question: Can Maple's optimization package treat this simple scheduling problem?

Good afternoon.

Here is (what appears to be) a simple assignment problem that involves scheduling 3 jobs through 2 machines, and I wish to minimize the total time required to complete all 3 jobs. Each job must be processed first on machine #1 before going to machine #2,and each machine can only handle one job at a time.

I have determined the optimal sequence to minimize the makespan (i.e., the completion time of the last job on machine #2) using a manual method and I was wondering if someone could review this (please see attached) and recommend a structured LP method or let me know if such a procedure exists in Maple's Optimization package.

Any help will be appreciated! 

Thanks for reading.

MaplePrimes_Nov_4.mw

Please Wait...