2008
DOI: 10.1111/j.1475-3995.2008.00635.x
|View full text |Cite
|
Sign up to set email alerts
|

Exact and heuristic algorithms for balancing transfer lines when a set of available spindle heads is given

Abstract: A balancing problem for paced tandem transfer lines with several spindle heads at each station is considered. A spindle head executes a block of operations. The set of all available spindle heads as well as the operations executed by each spindle head, the spindle head times and costs are known. There are operations with several spindle head candidates. The problem at the line design stage consists in the choice of spindle heads from the given set and their assignment to workstations. The goal is to minimize t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
5
0
1

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
1
1

Relationship

2
5

Authors

Journals

citations
Cited by 10 publications
(6 citation statements)
references
References 20 publications
0
5
0
1
Order By: Relevance
“…The set of available equipment or a crew of workers with diverse skill levels is limited and different constraints between equipment exist and have to be taken into account. This problem was considered for transfer machining lines with multi-spindle heads in [53], [54], [36], with partitioning problem in [55], [56], [57], and also in [58], [59], [60], [61], [62], [63], [64], [38]. In these cases, if one of these unique resources is allocated to a workstation, then it becomes unavailable for other workstations.…”
Section: Line Layout Design and Balancingmentioning
confidence: 99%
See 1 more Smart Citation
“…The set of available equipment or a crew of workers with diverse skill levels is limited and different constraints between equipment exist and have to be taken into account. This problem was considered for transfer machining lines with multi-spindle heads in [53], [54], [36], with partitioning problem in [55], [56], [57], and also in [58], [59], [60], [61], [62], [63], [64], [38]. In these cases, if one of these unique resources is allocated to a workstation, then it becomes unavailable for other workstations.…”
Section: Line Layout Design and Balancingmentioning
confidence: 99%
“…Meta-heuristic methods and Mixed integer programming (MIP), [30], [68], [69] High Graph approach [60], [61], [71]and Branch and bound [8], [38], […”
Section: Small Lowmentioning
confidence: 99%
“…In this paper, we focus on mathematical aspects of the preliminary design stage. Similar design problems for transfer machines with spindle heads are considered in (Dolgui et al, 2003;2005;2008, 2008a, 2008b, 2008c, 2009a, 2009b. Close problems of assembly line balancing are discussed in (Baybars, 1986;Ghosh and Gadnon, 1989;Erel andSarin, 1998, Scholl andKlein, 1998;Scholl, 1999;Rekiek et al, 2002;Dolgui and Proth, 2010).…”
Section: Introductionmentioning
confidence: 99%
“…The constraint set (3) specifies that all the blocks that compose the problem must be manufactured. The constraint set (4) represents exclusion constraints [3] and describes the impossibility of two operation to share the same working station. For example roughing and finishing operations are usually manufactured at different working station due to vibration and chip problems that could affect the quality of the machined surface.…”
mentioning
confidence: 99%
“…Inclusion constraints [3] are modeled by constraint set (5). These constraints are usually imposed when there are tight tolerance relationships that involve some operations of the two considered blocks.…”
mentioning
confidence: 99%