In this paper, a multi-period assignment problem is studied that arises as part of a weekly planning problem at mail processing and distribution centers. These facilities contain a wide variety of automation equipment that is used to cancel, sort, and sequence the mail. The input to the problem is an equipment schedule that indicates the number of machines required for each job or operation dur...

This paper presents the design of orientation stages for high-resolution imprint lithography machines. These machines implement a new lithography process known as Step and Flash Imprint Lithography (SFIL) and are intended for 1) sub 100 nm imprint demonstrations on flat substrates and 2) investigation of potential defect propagation during step and repeat imprinting. SFIL is an imprint lithogra...

This paper presents the design of orientation stages for high-resolution imprint lithography machines. These machines implement a new lithography process known as Step and Flash Imprint Lithography (SFIL) and are intended for 1) sub 100 nm imprint demonstrations on flat substrates and 2) investigation of potential defect propagation during step and repeat imprinting. SFIL is an imprint lithogra...

We study the problem of minimizing the makespan in a two-stage assembly flow shop scheduling problem with uniform parallel machines. This problem is a generalization of the assembly flow shop problem with concurrent operations in the first stage and a single assembly operation in the second stage. We propose a heuristic with an absolute performance bound which becomes asymptotically optimal as ...

How to extend standard support vector machines to solve multi-class classification problem and yield the outputs in the frame of Dempster-Shafer theory is useful. The multi-class probability support vector machine is proposed, firstly. The Dempster-Shafer theory based multi-class support vector machine is designed by constructing probability support vector machines for binary classification usi...

The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multihead Quantum Turing machines with multi final states that also allow tape heads to stay still.

By combining the abstract state machine (ASM) formalism with the multi-agent modeling paradigm, we obtain a formal framework for semantic modeling and integration of established theories of crime analysis and prediction. We focus here on spatial and temporal aspects of crime in urban areas. Our work contributes to a novel interdisciplinary research effort broadly classified as Computational Cri...

We investigate the multiprocessor multi stage open shop scheduling problem In this variant of the open shop model there are s stages each consisting of a number of parallel identical machines Each job consists of s operations one for each stage that can be executed in any order The goal is to nd a non preemptive schedule that minimizes the makespan We derive two approximation results for this N...