Bi-criteria assembly line balancing by considering flexible operation times

Applied Mathematical Modelling

Volumn 35, Issue 12, 2011, Pages 5592-5608

  Hamta, Nima ^a   Fatemi Ghomi, S M T ^a   Jolai, F ^b   Bahalke, Unes ^c  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

^c IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Assembly line balancing; Design of experiments; Flexible task times; Genetic algorithm; LP metric

Indexed keywords

ASSEMBLY LINE BALANCING; ASSEMBLY LINE BALANCING PROBLEMS; BI-CRITERIA; COMPUTATIONAL RESULTS; CYCLE TIME; DESIGN OF EXPERIMENTS METHODS; FLEXIBLE OPERATION; FLEXIBLE TASK TIMES; LINEAR FUNCTIONS; LOWER AND UPPER BOUNDS; LP-METRIC; NON-LINEAR INTEGER PROGRAMMING; NP-HARD PROBLEM; OBJECTIVE FUNCTIONS; OPERATION TIME; PROCESSING TIME; TOTAL COSTS;

ASSEMBLY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; DESIGN OF EXPERIMENTS; EXPERIMENTS; GENETIC ALGORITHMS; INTEGER PROGRAMMING;

ASSEMBLY MACHINES;

EID: 79960565579     PISSN: 0307904X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apm.2011.05.016     Document Type: Article

References (52)

1. Boysen N., Fliedner M., Scholl A. Assembly line balancing: which model to use when?. Int. J. Prod. Econ. 2008, 111:509-528.
2. Boysen N., Fliedner M., Scholl A. A classification of assembly line balancing problems. Eur. J. Oper. Res. 2007, 183:674-693.
3. Becker C., Scholl A. A survey on problems and methods in generalized assembly line balancing. Eur. J. Oper. Res. 2006, 168:694-715.
4. Kara Y., Paksoy T., Chang C.T. Binary fuzzy goal programming approach to single model straight and U-shaped assembly line balancing. Eur. J. Oper. Res. 2009, 195:335-347.
5. Ozcan U., Toklu B. Multiple-criteria decision-making in two-sided assembly line balancing: a goal programming and a fuzzy goal programming models. Comput. Oper. Res. 2009, 36:1955-1965.
6. Ozcan U. Balancing stochastic two-sided assembly lines: a chance-constrained, piecewise-linear, mixed integer program and a simulated annealing algorithm. Eur. J. Oper. Res. 2010, 205:81-97.
7. Toksari{dotless} M.D., Isleyen S.K., Guner E., Baykoc O.F. Assembly line balancing problem with deterioration tasks and learning effect. Expert Syst. Appl. 2010, 37:1223-1228.
8. Shahanaghi K., Yolmeh A.M., Bahalke U. Scheduling and balancing assembly lines with the task deterioration effect. Proc. Inst. Mech. Eng. B: J. Eng. Manuf. 2010, 224(7):1145-1153.
9. Agpak K., Gokcen H. Assembly line balancing: two resource constrained cases. Int. J. Prod. Econ. 2005, 96:129-140.
10. Chen R.S., Lu K.Y., Yu S.C. A hybrid genetic algorithm approach on multi-objective of assembly planning problem. Eng. Appl. Artif. Intell. 2002, 15:447-457.
11. Scholl A., Fliedner M., Boysen N. ABSALOM: balancing assembly lines with assignment restrictions. Eur. J. Oper. Res. 2010, 200:688-701.
12. Watkins R., Cochran J. A line balancing heuristic case study for existing automated surface mount assembly line setups. Comput. Ind. Eng. 1995, 29:681-685.
13. Andres C., Miralles C., Pastor R. Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. Eur. J. Oper. Res. 2008, 187:1212-1223.
14. Toksari M.D., Işleyen S.K., Güner E., Baykoç Ö.F. Simple and U-type assembly line balancing problems with a learning effect. Appl. Math. Model. 2008, 32:2954-2961.
15. Battini D., Faccio M., Persona A., Sgarbossa F. Balancing-sequencing procedure for a mixed model assembly system in case of finite buffer capacity. Int. J. Adv. Manuf. Technol. 2009, 44:345-359.
16. Becker C., Scholl A. Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure. Eur. J. Oper. Res. 2009, 199:359-374.
17. Berger I., Bourjolly J.M., Laporte G. Branch-and-bound algorithms for the multi-product assembly line balancing problem. Eur. J. Oper. Res. 1992, 58:215-222.
18. Boysen N., Fliedner M. A versatile algorithm for assembly line balancing. Eur. J. Oper. Res. 2008, 184:39-56.
19. Gokcen H., Agpak K., Benzer R. Balancing of parallel assembly lines. Int. J. Prod. Econ. 2006, 103:600-609.
20. Scholl A., Boysen N., Fliedner M. The sequence-dependent assembly line balancing problem. Oper. Res. Spectrum 2008, 30:579-609.
21. Amen M. Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds. Eur. J. Oper. Res. 2006, 168:747-770.
22. Amen M. Heuristic methods for cost-oriented assembly line balancing: a comparison on solution quality and computing time. Int. J. Prod. Econ. 2001, 69:255-264.
23. Scholl A., Becker C. A note on " An exact method for cost-oriented assembly line balancing" Int. J. Prod. Econ. 2005, 97:343-352.
24. Bock S. Using distributed search methods for balancing mixed-model assembly lines in the automotive industry. Oper. Res. Spectrum 2008, 30:551-578.
25. Levitin G., Rubinovitz J., Shnits B. A genetic algorithm for robotic assembly line balancing. Eur. J. Oper. Res. 2006, 168:811-825.
26. Bautista J., Cano J. Minimizing work overload in mixed-model assembly lines. Int. J. Prod. Econ. 2008, 112:177-191.
27. Kim Y.J., Kim Y.K., Cho Y. A heuristic-based genetic algorithm for workload smoothing in assembly lines. Comput. Oper. Res. 1997, 25:99-111.
28. Bukchin Y., Rabinowitch I. A branch-and-bound based solution approach for the mixed-model assembly line-balancing problem for minimizing stations and task duplication costs. Eur. J. Oper. Res. 2006, 174:492-508.
29. Tasan S.O., Tunali S. A review of the current applications of genetic algorithms in assembly line balancing. J. Intell. Manuf. 2008, 19:49-69.
30. Scholl A., Klein R. SALOME: a bidirectional branch and bound procedure for assembly line balancing. INFORMS J. Comput. 1997, 9:319-334.
31. Scholl A., Klein R. Balancing assembly lines effectively - a computational comparison. Eur. J. Oper. Res. 1999, 114:50-58.
32. Miralles C., Garcia Sabater J., Andres C., Cardos M. Branch and bound procedures for solving the assembly line worker assignment and balancing problem: application to sheltered work centres for disabled. Discrete Appl. Math. 2008, 156:352-367.
33. Nicosia G., Pacciarelli D., Pacifici A. Optimally balancing assembly lines with different workstations. Discrete Appl. Math. 2002, 118:99-113.
34. Kim Y.K., Song W.S., Kim J.H. A mathematical model and a genetic algorithm for two-sided assembly line balancing. Comput. Oper. Res. 2009, 36:853-865.
35. Simaria A.S., Vilarinho P.M. 2-ANTBAL: an ant colony optimization algorithm for balancing two-sided assembly lines. Comput. Ind. Eng. 2009, 56:489-506.
36. Lapierre S., Ruiz A., Soriano P. Balancing assembly lines with tabu search. Eur. J. Oper. Res. 2006, 168:826-837.
37. Kilincci O. A Petri net-based heuristic for simple assembly line balancing problem of type 2. Int. J. Adv. Manuf. Technol. 2010, 46:329-338.
38. Aryanezhad M.B., Kheirkhah A.S., Deljoo V., Mirzapour Al-e-hashem S.M.J. Designing safe job rotation schedules based upon workers' skills. Int. J. Adv. Manuf. Technol. 2009, 41:193-199.
39. M.B. Aryanezhad, A. Jabbarzadeh, A. Zareei, Combination of genetic algorithm and LP-metric to solve single machine bi-criteria scheduling problem, in: Proceedings of the 2009 IEEE IEEM, Hong Kong 2009, pp. 1915-1919.
40. Mahdavi Mazdeh M., Zaerpour F., Zareei A., Hajinezhad A. Parallel machines scheduling to minimize job tardiness and machine deteriorating cost with deteriorating jobs. Appl. Math. Model. 2010, 34:1498-1510.
41. Gutjahr A.L., Nemhauser G.L. An algorithm for the line balancing problem. Manage. Sci. 1964, 11:308-315.
42. Sivanandam S.N., Deepa S.N. Introduction to Genetic Algorithms 2008, Springer, New York.
43. Zhou H., Cheung W., Leung L.C. Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm. Eur. J. Oper. Res. 2009, 194:637-649.
44. Nearchou A.C. The effect of various operators on the genetic search for large scheduling problems. Int. J. Prod. Econ. 2004, 88:191-203.
45. Vallada E., Ruiz R. Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem. Omega 2010, 38:57-67.
46. Ruiz R., Maroto C., Alcaraz J. Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics. Eur. J. Oper. Res. 2005, 165:34-54.
47. Ruiz R., Maroto C., Alcaraz J. Two new robust genetic algorithms for the flowshop scheduling problem. Omega 2006, 34:461-476.
48. Bahalke U., Yolmeh A.M., Shahanaghi K. Meta-heuristics to solve single-machine scheduling problem with sequence-dependent setup time and deteriorating jobs. Int. J. Adv. Manuf. Technol. 2010, 50:749-759.
49. Seyed-Alagheband S.A., Fatemi Ghomi S.M.T., Zandieh M. A simulated annealing algorithm for balancing the assembly line type II problem with sequence-dependent setup times between tasks. Int. J. Prod. Res. 2011, 49(3):805-825.
50. Keuls M. The use of the studentized range in connection with an analysis of variance. Euphytica 1952, 1:112-122.
51. Nearchou A.C. Balancing large assembly lines by a new heuristic based on differential evolution method. Int. J. Adv. Manuf. Technol. 2007, 34:1016-1029.
52. Roshanaei V., Naderi B., Jolai F., Khalili M. A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Gen. Comput. Syst. 2009, 25:654-661.