![]() | ![]() |
Bahman Naderi
List of publications from the DBLP Bibliography Server - FAQ
| 2011 | ||
|---|---|---|
| 15 | B. Naderi, M. Zandieh, M. Aminnayeri: Incorporating periodic preventive maintenance into flexible flowshop scheduling problems. Appl. Soft Comput. 11(2): 2094-2101 (2011) | |
| 14 | A. Rad, B. Naderi, M. Soltani: Clustering and ranking university majors using data mining and AHP algorithms: A case study in Iran. Expert Syst. Appl. 38(1): 755-763 (2011) | |
| 13 | B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh: Scheduling open shops with parallel machines to minimize total completion time. J. Computational Applied Mathematics 235(5): 1275-1287 (2011) | |
| 2010 | ||
| 12 | Masoud Jenabi, Bahman Naderi, S. M. T. Fatemi Ghomi: A bi-objective case of no-wait flowshops. BIC-TA 2010: 1048-1056 | |
| 11 | Bahman Naderi, Masoud Jenabi, S. M. T. Fatemi Ghomi, Davoud Talebi: An electromagnetism-like metaheuristic for sequence dependent open shop scheduling. BIC-TA 2010: 489-497 | |
| 10 | B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri: A high performing metaheuristic for job shop scheduling with sequence-dependent setup times. Appl. Soft Comput. 10(3): 703-710 (2010) | |
| 9 | B. Naderi, S. M. T. Fatemi Ghomi, M. Aminnayeri, M. Zandieh: A contribution and new heuristics for open shop scheduling. Computers & OR 37(1): 213-221 (2010) | |
| 8 | B. Naderi, Rubén Ruiz, M. Zandieh: Algorithms for a realistic variant of flowshop scheduling. Computers & OR 37(2): 236-246 (2010) | |
| 7 | B. Naderi, Rubén Ruiz: The distributed permutation flowshop scheduling problem. Computers & OR 37(4): 754-768 (2010) | |
| 6 | B. Naderi, Reza Tavakkoli-Moghaddam, M. Khalili: Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan. Knowl.-Based Syst. 23(2): 77-85 (2010) | |
| 2009 | ||
| 5 | B. Naderi, M. Khalili, Reza Tavakkoli-Moghaddam: A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time. Computers & Industrial Engineering 56(4): 1494-1501 (2009) | |
| 4 | B. Naderi, M. Zandieh, M. A. H. A. Shirazi: Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization. Computers & Industrial Engineering 57(4): 1258-1267 (2009) | |
| 3 | B. Naderi, M. Zandieh, A. Khaleghi Ghoshe Balagh, V. Roshanaei: An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst. Appl. 36(6): 9625-9633 (2009) | |
| 2 | V. Roshanaei, B. Naderi, F. Jolai, M. Khalili: A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Generation Comp. Syst. 25(6): 654-661 (2009) | |
| 1 | Reza Tavakkoli-Moghaddam, M. Khalili, B. Naderi: A hybridization of simulated annealing and electromagnetic-like mechanism for job shop problems with machine availability and sequence-dependent setup times to minimize total weighted tardiness. Soft Comput. 13(10): 995-1006 (2009) | |
| 1 | M. Aminnayeri | [9] [10] [13] [15] |
| 2 | A. Khaleghi Ghoshe Balagh | [3] |
| 3 | Seyyed M. T. Fatemi Ghomi (S. M. T. Fatemi Ghomi) | [9] [10] [11] [12] [13] |
| 4 | Masoud Jenabi | [11] [12] |
| 5 | F. Jolai | [2] |
| 6 | M. Khalili | [1] [2] [5] [6] |
| 7 | A. Rad | [14] |
| 8 | V. Roshanaei | [2] [3] |
| 9 | Rubén Ruiz | [7] [8] |
| 10 | M. A. H. A. Shirazi | [4] |
| 11 | M. Soltani | [14] |
| 12 | Davoud Talebi | [11] |
| 13 | Reza Tavakkoli-Moghaddam | [1] [5] [6] |
| 14 | M. Zandieh | [3] [4] [8] [9] [13] [15] |
Colors in the list of coauthors
Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page