Balancing and scheduling of flexible mixed model assembly lines

Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today’s competitive market, the mixed model assembly line balancing problem has been turned into an...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Constraints : an international journal Ročník 18; číslo 3; s. 434 - 469
Hlavní autoři: Öztürk, Cemalettin, Tunalı, Semra, Hnich, Brahim, Örnek, M. Arslan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.07.2013
Springer
Témata:
Application
Applied sciences
Artificial Intelligence
Computer Science
Exact sciences and technology
Firm modelling
Inventory control, production control. Distribution
Mathematical programming
Operational research and scientific management
Operational research. Management science
Operations Research/Decision Theory
Optimization
Scheduling, sequencing
Balancing
Constraint programming
Mixed integer programming
Scheduling
Decomposition
Mixed model assembly lines
Sequencing
Assembly line
Empirical method
Constraint satisfaction
Buffer system
Modeling
Constrained optimization
Production management
Economic market
Product structure
Flexible manufacturing system
Capacity constraint
Open market
ISSN:1383-7133, 1572-9354
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Mixed model assembly line literature involves two problems: balancing and model sequencing. The general tendency in current studies is to deal with these problems in different time frames. However, in today’s competitive market, the mixed model assembly line balancing problem has been turned into an operational problem. In this paper, we propose mixed integer programming (MIP) and constraint programming (CP) models which consider both balancing and model sequencing within the same formulation along with the optimal schedule of tasks at a station. Furthermore, we also compare the proposed exact models with decomposition schemes developed for solving different instances of varying sizes. This is the first paper in the literature which takes into account the network type precedence diagrams and limited buffer capacities between stations. Besides, it is the first study that CP method is applied to balancing and scheduling of mixed model assembly lines. Our empirical study shows that the CP approach outperforms the MIP approach as well as the decomposition schemes.
ISSN:1383-7133
1572-9354
DOI:10.1007/s10601-013-9142-6