Paper Info
Title
Balancing and scheduling of flexible mixed model assembly lines
Abstract
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.
Year
DOI
Venue
2013
10.1007/s10601-013-9142-6
Constraints
Keywords
Field
DocType
flexible mixed model assembly,current study,constraint programming,decomposition scheme,model sequencing,mixed model assembly line,proposed exact model,mip approach,cp approach,different instance,cp method,sequencing,mixed integer programming,scheduling,decomposition
Mathematical optimization,Computer science,Scheduling (computing),Constraint programming,Mixed model,Integer programming,Operational Problem,Empirical research,Line balancing
Journal
Volume
Issue
ISSN
18
3
1572-9354
Citations 
PageRank 
References 
7
0.60
33
Authors
4
Name
Order
Citations
PageRank
Cemalettin Öztürk1123.86
Semra Tunali212910.12
Brahim Hnich395969.87
Arslan Örnek4304.81