Now showing items 11-16 of 16
Scheduling to minimize the coefficient of variation
In this paper, we address the problem of uninterruptedly scheduling a set of independent jobs that are ready at time zero with the objective of minimizing the coefficient of variation (CV) of their completion times. We ...
Spatial analysis of single allocation hub location problems
Hubs are special facilities that serve as switching, transshipment and sorting nodes in many-to-many distribution systems. Flow is consolidated at hubs to exploit economies of scale and to reduce transportation costs between ...
Joint lot sizing and tool management in a CNC environment
We propose a new algorithm to solve lot sizing, tool allocation and machining conditions optimization problems simultaneously to minimize total production cost in a CNC environment. Most of the existing lot sizing and tool ...
Denoising images corrupted by impulsive noise using projections onto the epigraph set of the total variation function (PES-TV)
(Springer U K, 2015)
In this article, a novel algorithm for denoising images corrupted by impulsive noise is presented. Impulsive noise generates pixels whose gray level values are not consistent with the neighboring pixels. The proposed ...
A Hamiltonian-based solution to the mixed sensitivity optimization problem for stable pseudorational plants
This paper considers the mixed sensitivity optimization problem for a class of infinite-dimensional stable plants. This problem is reducible to a two- or one-block H∞ control problem with structured weighting functions. ...
Batch scheduling to minimize the weighted number of tardy jobs
(Pergamon Press, 2007)
In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ...