Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm
Published 2014 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
Two-sided assembly line balancing with operator number and task constraints: a hybrid imperialist competitive algorithm
Authors
Keywords
Two-sided assembly line balancing problem, Operator number, Task constraints, Hybrid imperialist competitive algorithm
Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
Volume 74, Issue 5-8, Pages 791-805
Publisher
Springer Nature
Online
2014-06-11
DOI
10.1007/s00170-014-5816-5
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- The economic lot scheduling problem with deteriorating items and shortage: an imperialist competitive algorithm
- (2012) V. Kayvanfar et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- A hybrid imperialist competitive algorithm for single-machine scheduling problem with linear earliness and quadratic tardiness penalties
- (2012) A. H. Banisadr et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Cost-oriented two-sided assembly line balancing problem: A simulated annealing approach
- (2012) Abdolreza Roshani et al. INTERNATIONAL JOURNAL OF COMPUTER INTEGRATED MANUFACTURING
- An imperialist competitive algorithm for a mixed-model assembly line sequencing problem
- (2012) Hadi Moradi et al. JOURNAL OF MANUFACTURING SYSTEMS
- Multi-objective two-sided mixed-model assembly line balancing using particle swarm optimisation with negative knowledge
- (2011) Parames Chutima et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Balancing of mixed-model two-sided assembly lines with multiple U-shaped layout
- (2011) Masoud Rabbani et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- Two-sided assembly lines balancing with assignment restrictions
- (2011) Hindriyanto Dwi Purnomo et al. MATHEMATICAL AND COMPUTER MODELLING
- Bees Algorithm for constrained fuzzy multi-objective two-sided assembly line balancing problem
- (2011) Pınar Tapkan et al. Optimization Letters
- A branch-and-bound algorithm to minimize the line length of a two-sided assembly line
- (2010) Hu Xiaofeng et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Balancing of stochastic U-type assembly lines: an imperialist competitive algorithm
- (2010) M. Bagher et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem
- (2010) E. Shokrollahpour et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Balancing stochastic two-sided assembly lines: A chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm
- (2009) Uğur Özcan EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
- Balancing two-sided assembly lines with sequence-dependent setup times
- (2009) Uğur Özcan et al. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH
- Balancing of mixed-model two-sided assembly lines
- (2008) Uğur Özcan et al. COMPUTERS & INDUSTRIAL ENGINEERING
- Multiple-criteria decision-making in two-sided assembly line balancing: A goal programming and a fuzzy goal programming models
- (2008) Uğur Özcan et al. COMPUTERS & OPERATIONS RESEARCH
- A tabu search algorithm for two-sided assembly line balancing
- (2008) Uğur Özcan et al. INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
- 2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines
- (2007) Ana S. Simaria et al. COMPUTERS & INDUSTRIAL ENGINEERING
- A mathematical model and a genetic algorithm for two-sided assembly line balancing
- (2007) Yeo Keun Kim et al. COMPUTERS & OPERATIONS RESEARCH
- A station-oriented enumerative algorithm for two-sided assembly line balancing
- (2007) Xiaofeng Hu et al. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Find the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
SearchAsk a Question. Answer a Question.
Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.
Get Started