This is iSolveFlowShop, a computational app solving the flow shop problem encountered in Operations Management: many orders have to be sequenced on multiple consecutive machines. Data consist of operation times of each order on each machine. Problem is which best sequence of orders will minimize the makespan, i.e. the total time needed to process all orders. Algorithms proposed in this app are the Johnson method, Dannenbring, Palmer and the complete enumeration.
Though the complete enumeration algorithm always gives at least one optimal solution to the flow shop problem, we have to limit it to a maximum number of orders to consider because it takes lot of computational time when the number of orders is high (we limit it to 10 orders when using the complete enumeration algorithm).
- Universal app (iPhone, iPod Touch, iPad)
- Support all iPad orientations
- A solution can be shared via iTunes File Sharing or sent through email