This paper shows that there exist linear models for sensor pose estimation for multi-view panoramas defined by a symmetric or leveled pair of cylindric images. It assumes that pair...
We study the problem of optimal preemptive scheduling with respect to a general target function. Given n jobs with associated weights and m ≤ n uniformly related machines, one a...
1 We have developed an approach to acquire complicated user optimization criteria and use them to guide iterative solution improvement. The eectiveness of the approach was tested ...
The proportionate flow shop (PFS) is considered as a unique case of the flow shop problem in which the processing times of the operations belonging to the same job are equal. A pr...
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedu...