A survey of exact algorithms for the simple assembly line balancing problem
Management Science
Designing parallel assembly lines
ICC&IE Selected papers from the 22nd ICC&IE conference on Computers & industrial engineering
Two-sided assembly line balancing to maximize work relatedness and slackness
Computers and Industrial Engineering
Automation, Production Systems, and Computer Integrated Manufacturing
Automation, Production Systems, and Computer Integrated Manufacturing
Minimizing makespan in a two-machine flowshop with dynamic arrivals allowed
Computers and Operations Research
Computers and Operations Research
Minimizing makespan for multi-spindle head machines with a mobile table
Computers and Operations Research
Balancing modular transfer lines with serial-parallel activation of spindle heads at stations
Discrete Applied Mathematics
2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines
Computers and Industrial Engineering
Balancing of mixed-model two-sided assembly lines
Computers and Industrial Engineering
Assembly line balancing with station paralleling
Computers and Industrial Engineering
A MIP approach for balancing transfer line with complex industrial constraints
Computers and Industrial Engineering
Computers and Industrial Engineering
Supply Chain Engineering
Three is easy, two is hard: open shop sum-batch scheduling problem refined
Operations Research Letters
Assembly line balancing under uncertainty: Robust optimization models and exact solution method
Computers and Industrial Engineering
| Hi-index | 0.00 |
Modular machining lines with multi-spindle workstations are considered. A multi-spindle head executes a set of operations. The problem of optimal design or reconfiguration of such lines is considered here. The set of all available spindle heads, operations executed by each spindle head, spindle head times and costs are assumed to be known. There are operations which can be executed by one of several candidate spindle heads, i.e., in different configuration with other operations. The problem consists in the choice of spindle heads from the given set and their assignment to workstations. The goal is to minimize the line cost while satisfying the precedence, inclusion and exclusion constraints. This problem is an extension of well known assembly line balancing and equipment selection problem. In our previous work, we proposed a MIP model which was significantly limited as to the size of the problems treated. In this paper, quite a few original approaches are suggested to improve the previous MIP model. The numerical tests reported show that the calculation time is drastically decreased, thereby expanding the model to larger and more realistic industrial problems.