Search
Now showing items 11-19 of 19
Assembly job shop scheduling problems with component availability constraints.
(2007)
Job shop scheduling has been widely studied for several decades. In generalized of the job shop scheduling problem, n jobs are to be processed on m machines under specific routings and due dates. The majority of job shop ...
Dynamic optimization of service part inventory control policy through applied data mining and simulation.
(2007)
This research defines a novel approach for associating inventory item behavior, focusing initially on demand patterns, with an optimal inventory control policy. This method relies upon the definition of typical service ...
Optimization issues in data analysis: An analytic center approach to kernel methods.
(2001)
Support vector machines have recently attracted much attention in the machine learning and optimization communities for their remarkable generalization ability. The support vector machine solution corresponds to the center ...
An intelligent search-based methodology for selection of sample points for form error estimation.
(2002)
Efficient part feature verification through CMM requires prudent sampling of data points. This dissertation presents an adaptive sampling procedure, which uses manufacturing error patterns and optimization search methods ...
Computational aspects of various Benders-based procedures for mixed integer programming /
(The University of Oklahoma., 1973)
Multicriteria plant layout with evaluation by simulation.
(1997)
Another significant contribution of this research is that the layouts generated from this procedure are quickly incorporated into a simulation model which is used for evaluating layouts. Simulation offers a rich evaluation ...
The application of capital market equilibrium theory and mathematical programming to the capital budgeting problem under uncertainty.
(The University of Oklahoma., 1974)
Differential-algebraic equations in primal dual interior point optimization methods: A new approach to the parameterization of the central trajectory.
(2003)
Interior Point Methods (IPMs) are iterative algorithms for mathematical optimization problems that can be interpreted as path-following procedures. Given a starting solution, the iterative scheme generates a sequence of ...