Proposed a branch and bound algorithm for Assembly flow shop scheduling problem
Assembly flow shop production system includes two stages. In the first stage that is usually assumed one station with some parallel machines, the parts are processed. The second stage is an assembly station (or line) to assemble the parts and complete the products. Suppose that a number of products...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | fas |
| Published: |
Semnan University
2017-12-01
|
| Series: | مجله مدل سازی در مهندسی |
| Subjects: | |
| Online Access: | https://modelling.semnan.ac.ir/article_2679_ed742650d104a3be31c8ebfcd438c7fc.pdf |
| Summary: | Assembly flow shop production system includes two stages. In the first stage that is usually assumed one station with some parallel machines, the parts are processed. The second stage is an assembly station (or line) to assemble the parts and complete the products. Suppose that a number of products of different kinds are ordered to be produced and each product needs a set of several parts to complete. Some of the parts are common and some others are unique for each product. Therefore it is important to study the setup times and batch production. The aim is to schedule the parts for process and the products for assembly with the minimum complete time objective. Literature review shows that the considered problem is a NP-Hard problem, so the problem characteristics and its parameters are defined and then a branch and bound algorithm is introduced to solve the small and mediocre problems. Some lower bounds and upper bounds are improved to increase the algorithm efficiency. Finally, a variety of problem is designed and performance of the proposed algorithm is evaluated in solving this problems. |
|---|---|
| ISSN: | 2008-4854 2783-2538 |