Olga Guschinskaya

Learn More
In this paper, we consider a problem of balancing transfer lines with multi-spindle machines. The problem has a number of distinct features in comparison with the well-studied Assembly Line Balancing Problem, such as parameterized operation times, non-strict precedence constraints, and parallel operations execution. We propose MIP-based greedy randomized(More)
We study an optimal design problem for serial machining lines. Such lines consist of a sequence of stations. At every station, the operations to manufacture a product are grouped into blocks. The operations within each block are performed simultaneously by the same spindle head and the blocks of the same station are executed sequentially. The inclusion and(More)
This paper studies the performance of a group of heuristic methods developed to solve the alternative subgraphs assembly line balancing problem. This problem implies selecting an assembly subgraph for each subassembly that allows alternatives and assigning the tasks to the workstations, simultaneously. A computational experiment is carried out to analyse(More)
We focus on one of the simple assembly line balancing problems known as SALBP-2 which consists in assigning a set of elementary operations V = {1, 2, &#x2026; , n} to the m linearly ordered stations with respect to the precedence constraints and aims in minimizing the line cycle time c. The processing times of operations t<inf>j</inf> , j &#x2208; V may(More)
This paper proposes and evaluates fourteen heuristic methods to solve the Alternative Subgraphs Assembly Line Balancing Problem, in which assembly variants (subgraphs) are allowed for different parts of an assembly process. To solve this problem efficiently, both subgraphs selection and task assignment have to be carried out simultaneously. All proposed(More)
The Transfer Line Balancing Problem (TLBP) deals with the optimization of design solutions for serial machining lines. Such lines consist of a sequence of transfer machines. At every machine, the operations are performed by blocks. The blocks are processed sequentially and the operations within each block are executed simultaneously by the same(More)
We study the problem of minimizing makespan for part machining on a multi-spindle heads machine with a mobile table. We show that this problem can be formulated as a scheduling problem for a single batch machine with compatibility and precedence constraints between jobs. Jobs grouped in a batch are processed simultaneously, but the difference from(More)