Manufacturing cell formation with flexible processing capabilities and worker assignment: Comparison of constraint programming and integer programming approaches
| Autor: | Seyda Topaloglu, Adil Baykasoğlu, Filiz Şenyüzlüler |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Concurrent constraint logic programming
0209 industrial biotechnology Mathematical optimization Computer science Mechanical Engineering Cellular manufacturing 02 engineering and technology Constraint satisfaction Industrial and Manufacturing Engineering Inductive programming 020303 mechanical engineering & transports 020901 industrial engineering & automation Group technology 0203 mechanical engineering Constraint programming Reactive programming Functional reactive programming |
| Zdroj: | Proceedings of the Institution of Mechanical Engineers, Part B: Journal of Engineering Manufacture. 232:2054-2068 |
| ISSN: | 2041-2975 0954-4054 |
| DOI: | 10.1177/0954405416682281 |
| Popis: | Cell formation deals with grouping of machines and parts in manufacturing systems according to their compatibility. Manufacturing processes are surrounded with an abundance of complex constraints which should be considered carefully and represented clearly for obtaining high efficiency and productivity. Constraint programming is a new approach to combinatorial optimization and provides a rich language to represent complex constraints easily. However, the cell formation problems are well suited to be solved by constraint programming approach since the problem has many constraints such as part-machine requirements, availabilities in the system in terms of capacity, machine and worker abilities. In this study, the cell formation problem is modeled using machine, part processing and worker flexibilities via resource element–based representation. Resource elements define the processing requirements of parts and processing capabilities of machines and workers, which are resource-independent capability units. A total of 12 case problems are generated, and different search phases of constraint programming are defined for the solution procedure. The cell formation problem is modeled in both constraint programming and integer programming, and a comparative analysis of constraint programming and integer programming model solutions is done. The results indicate that both the models are effective and efficient in the solution of the cell formation problem. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|