#### Filter Results:

- Full text PDF available (16)

#### Publication Year

2006

2018

- This year (4)
- Last 5 years (35)
- Last 10 years (53)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- B. Naderi, RubÃ©n Ruiz
- Computers & OR
- 2010

This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under thisâ€¦ (More)

- B. Naderi, RubÃ©n Ruiz
- European Journal of Operational Research
- 2014

- B. Naderi, RubÃ©n Ruiz, Mostafa Zandieh
- Computers & OR
- 2010

This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and parallel machine problemsâ€¦ (More)

- B. Naderi, Nasser Salmasi
- 2012

This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|âˆ‘Cj). The research problem isâ€¦ (More)

This article addresses the problem of scheduling hybrid flowshops where the setup times are sequence dependent to minimize makespan and maximum tardiness. To solve such an NP-hard problem, weâ€¦ (More)

- RubÃ©n Ruiz, B. Naderi
- 2009

In the permutation flowshop problem (PFSP) a set N of n unrelated jobs are to be processed on a set M of m machines. These machines are disposed in series and each job has to visit all of them in theâ€¦ (More)

- B. Naderi, Seyyed M. T. Fatemi Ghomi, M. Aminnayeri
- Appl. Soft Comput.
- 2010

This paper investigates scheduling job shop problems with sequence-dependent setup times under minimization of makespan. We develop an effective metaheuristic, simulated annealing with novelâ€¦ (More)

- A. Rad, B. Naderi, Mohsen Nourbakhsh Soltani
- Expert Syst. Appl.
- 2011

Although all university majors are prominent, and the necessity of their presence is of no question, they might not have the same priority basis considering different resources and strategies thatâ€¦ (More)

- Rasul Esmaeilbeigi, B. Naderi, Parisa Charkhgard
- Computers & OR
- 2015

Although the simple assembly line balancing problem (SALBP) is the topic of many studies, typically they either consider minimizing the number of stations for a given cycle time (called type one), orâ€¦ (More)

- Mehdi Yazdani, B. Naderi
- 2016

Although several papers have studied no-idle scheduling problems, they all focused on flow shops, assuming one processor at each working stage. But, companies commonly extend to hybrid flow shops byâ€¦ (More)