This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

In this research, we investigate a three-stage supply chain with one supplier, several manufacturers and multiple retailers where the supplier provides a common raw material to each manufacturer, who in turn uses a single stage production facility to convert it into final products that are delivered at fixed lot sizes to retailers. An integrated economic procurement, production, and delivery mo...

Logistic enterprises are increasingly becoming smarter and more efficient by using real-time contextual data. A currently unsolved problem for small to medium sized logistic service providers (SMLSPs) is, how to use real time data in existing business processes & IT systems. Enterprise architecture can be used as a tool to solve this problem and aid in adapting existing processes & IT. This wou...

We consider the problem of locating a light coin out of a set containing n coins, n ? 1 of which have the same weight. The weighing device is a balance with r 2 pans and, when r equally sized subset of coins are weighted, it indicates the eventual subset containing the light coin. We give an algorithm to nd the counterfeit coin that requires the minimum possible average number of weighings. All...

The geometric hitting set problem is one of the basic geometric combinatorial optimization problems: given a set P of points, and a set D of geometric objects in the plane, the goal is to compute a small-sized subset of P that hits all objects in D. In 1994, Bronniman and Goodrich [6] made an important connection of this problem to the size of fundamental combinatorial structures called -nets, ...

Recent high-resolution simulations of the formation of dark-matter halos have shown that the distribution of subhalos is scale-free, in the sense that if scaled by the velocity dispersion of the parent halo, the subhalo velocity distribution function of galaxy-sized and cluster-sized halos are identical. For clustersized halos, simulation results agreed well with observations. Simulations, howe...

A method of scaling is described that easily converts the aeroelastic equations of motion of a full-sized aircraft into ones of a wind-tunnel model. To implement the method, a set of rules is provided for the conversion process involving matrix operations with scale factors. In addition, a technique for analytically incorporating a spring mounting system into the aeroelastic equations is also p...