A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements
| Autor: | Dilek Ogan, Meral Azizoglu |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Mathematical optimization
Workstation Branch and bound Computer science Branch and price Type (model theory) Industrial and Manufacturing Engineering law.invention Set (abstract data type) Task (computing) Hardware and Architecture Control and Systems Engineering law Line balancing Branch and cut Software |
| Zdroj: | Journal of Manufacturing Systems. 36:46-54 |
| ISSN: | 0278-6125 |
| DOI: | 10.1016/j.jmsy.2015.02.007 |
| Popis: | In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bounds. We find that the algorithm is able to solve moderate sized problem instances in reasonable times. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect