![]()
Modeling of Scheduling Algorithms with Alternative Process Plans in an Optimization Programming Language
Display Full Text |
Download Full Text
1.32 MB PDF file
This thesis optimizes scheduling functions with alternative processes for manufacturing features. The problem considered is an N job – M methods problem, where each feature can be processed in up to M methods. Linear and polynomial models have been built in Optimization Language (OPL) to optimize the make span without setup times. The user is provided an interface in Java to enter the system parameters, generate the data file, choose the OPL model and execute the model. This thesis concludes that in the absence of heuristics, linear model performs better than a non-linear model for the same problem and combining system parameters intelligently gives a better chance of solving the problem faster.
Document number: ohiou1108045192
Permalink: http://rave.ohiolink.edu/etdc/view?acc_num=ohiou1108045192
This ETD has been downloaded 754 times (through March 2013)
© 2004, all rights reserved.
This open access ETD is published by
Ohio University and OhioLINK.