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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Constraints : an international journal Jg. 18; H. 3; S. 434 - 469
Hauptverfasser: Öztürk, Cemalettin, Tunalı, Semra, Hnich, Brahim, Örnek, M. Arslan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Boston Springer US 01.07.2013
Springer
Schlagworte:
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
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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