ABSTRACT The paper deals with optimal balancing transfer lines where the operations in each works... more ABSTRACT The paper deals with optimal balancing transfer lines where the operations in each workstation are grouped into blocks. All operations of the same block are executed simultaneously by one spindle head. Spindle heads of the same workstation are activated sequentially. The workstation time is the sum of the processing times of its blocks. The problem is to find the best assignment of operations to blocks and assignment of blocks to workstations that leads to the minimal transfer line cost (a weighted sum of blocks and workstation numbers). The solution must provide a desired productivity rate (cycle time). It must also satisfy precedence and compatibility constraints. Two heuristic algorithms based on the COMSOAL technique are proposed. Results from computer testing are reported.
Proceedings of the 15th IFAC World Congress, Jul 21, 2002
Abstract: This paper is devoted to a preliminary design problem of paced automatic transfer lines... more Abstract: This paper is devoted to a preliminary design problem of paced automatic transfer lines. The aim is to choose a logical layout of the line which minimises its cost subject to the given productivity and technological constraints. The paper focuses on a mathematical model of the problem and a method to solve it. The proposed method is based on the transformation of the initial problem into a constrained shortest path problem.
Http Dx Doi Org 10 1080 07408170500531334, Feb 23, 2007
A transfer line balancing problem is considered. It differs from assembly line balancing problems... more A transfer line balancing problem is considered. It differs from assembly line balancing problems because the operations of each workstation are partitioned into blocks of parallel operations. Blocks of a given workstation are executed sequentially. Operations compatibility constraints for a block and for a workstation as well as precedence constraints are explained. The goal is to minimize a weighted sum of the number of workstations and the number of blocks (an estimation of the investment cost) to achieve a desired cycle time and to satisfy the constraints. The proposed methods are based on mixed integer programming models. Experimental results with ILOG CPLEX solver are discussed.
ABSTRACT The paper deals with optimal balancing transfer lines where the operations in each works... more ABSTRACT The paper deals with optimal balancing transfer lines where the operations in each workstation are grouped into blocks. All operations of the same block are executed simultaneously by one spindle head. Spindle heads of the same workstation are activated sequentially. The workstation time is the sum of the processing times of its blocks. The problem is to find the best assignment of operations to blocks and assignment of blocks to workstations that leads to the minimal transfer line cost (a weighted sum of blocks and workstation numbers). The solution must provide a desired productivity rate (cycle time). It must also satisfy precedence and compatibility constraints. Two heuristic algorithms based on the COMSOAL technique are proposed. Results from computer testing are reported.
Proceedings of the 15th IFAC World Congress, Jul 21, 2002
Abstract: This paper is devoted to a preliminary design problem of paced automatic transfer lines... more Abstract: This paper is devoted to a preliminary design problem of paced automatic transfer lines. The aim is to choose a logical layout of the line which minimises its cost subject to the given productivity and technological constraints. The paper focuses on a mathematical model of the problem and a method to solve it. The proposed method is based on the transformation of the initial problem into a constrained shortest path problem.
Http Dx Doi Org 10 1080 07408170500531334, Feb 23, 2007
A transfer line balancing problem is considered. It differs from assembly line balancing problems... more A transfer line balancing problem is considered. It differs from assembly line balancing problems because the operations of each workstation are partitioned into blocks of parallel operations. Blocks of a given workstation are executed sequentially. Operations compatibility constraints for a block and for a workstation as well as precedence constraints are explained. The goal is to minimize a weighted sum of the number of workstations and the number of blocks (an estimation of the investment cost) to achieve a desired cycle time and to satisfy the constraints. The proposed methods are based on mixed integer programming models. Experimental results with ILOG CPLEX solver are discussed.
Uploads
Papers by N. Guschinsky