B. Naderi

Orcid: 0000-0002-6026-9074

Affiliations:
  • University of Windsor, Faculty of Engineering, Production & Operations Management Research Lab, Windsor, Canada
  • Kharazmi University, Tehran, Iran


According to our database1, B. Naderi authored at least 61 papers between 2009 and 2022.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling.
INFORMS J. Optim., January, 2022

Modeling and solution methods for hybrid flow shop scheduling problem with job rejection.
Oper. Res., 2022

Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition.
INFORMS J. Comput., 2022

Formulation and exact algorithms for electric vehicle production routing problem.
Expert Syst. Appl., 2022

Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms.
Comput. Oper. Res., 2022

2021
Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut.
Eur. J. Oper. Res., 2021

Production scheduling for reconfigurable assembly systems: Mathematical modeling and algorithms.
Comput. Ind. Eng., 2021

2020
Multi-Objective Stochastic Fractal Search: a powerful algorithm for solving complex multi-objective optimization problems.
Soft Comput., 2020

Maximal covering salesman problems with average travelling cost constrains.
Int. J. Math. Oper. Res., 2020

Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling.
Eur. J. Oper. Res., 2020

New robust optimization models for closed-loop supply chain of durable products: Towards a circular economy.
Comput. Ind. Eng., 2020

A Benders decomposition approach for a real case supply chain network design with capacity acquisition and transporter planning: wheat distribution network.
Ann. Oper. Res., 2020

2019
The cycle shop scheduling: mathematical model, properties and solution algorithms.
RAIRO Oper. Res., 2019

A robust possibilistic programming model for water allocation problem.
RAIRO Oper. Res., 2019

A realistic multi-manned five-sided mixed-model assembly line balancing and scheduling problem with moving workers and limited workspace.
Int. J. Prod. Res., 2019

A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes.
Expert Syst. Appl., 2019

Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems.
Comput. Oper. Res., 2019

An optimization model of three-player payoff based on fuzzy game theory in green supply chain.
Comput. Ind. Eng., 2019

The economic lot scheduling problem in limited-buffer flexible flow shops: Mathematical models and a discrete fruit fly algorithm.
Appl. Soft Comput., 2019

2018
Bi-objective optimization of a job shop with two types of failures for the operating machines that use automated guided vehicles.
Reliab. Eng. Syst. Saf., 2018

Modelling and solving the integrated inventory-location-routing problem in a multi-period and multi-perishable product supply chain with uncertainty: Lagrangian relaxation algorithm.
Comput. Chem. Eng., 2018

A preemptive fuzzy goal programming model for generalized supplier selection and order allocation with incremental discount.
Comput. Ind. Eng., 2018

Portfolio rebalancing with respect to market psychology in a fuzzy environment: A case study in Tehran Stock Exchange.
Appl. Soft Comput., 2018

2017
Multi-objective optimization considering quality concepts in a green healthcare supply chain for natural disaster response: neural network approaches.
Int. J. Syst. Assur. Eng. Manag., 2017

Truck routing and scheduling for cross-docking in the supply chain: model and solution method.
RAIRO Oper. Res., 2017

Solving a fuzzy multi objective model of a production-distribution system using meta-heuristic based approaches.
J. Intell. Manuf., 2017

Modelling and scheduling multi-objective flow shop problems with interfering jobs.
Appl. Soft Comput., 2017

Hybrid Genetic Algorithm and Invasive Weed Optimization via Priority Based Encoding for Location-Allocation Decisions in a Three-Stage Supply Chain.
Asia Pac. J. Oper. Res., 2017

2016
New formulations for the setup assembly line balancing and scheduling problem.
OR Spectr., 2016

An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems.
Comput. Ind. Eng., 2016

Supply chain networks design with multi-mode demand satisfaction policy.
Comput. Ind. Eng., 2016

Optimal decisions in a dual-channel supply chain under simultaneous demand and production cost disruptions.
Ann. Oper. Res., 2016

2015
A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems.
Neural Comput. Appl., 2015

A Model and Metaheuristic for Truck Scheduling in Multi-door Cross-dock Problems.
Intell. Autom. Soft Comput., 2015

The type E simple assembly line balancing problem: A mixed integer linear programming formulation.
Comput. Oper. Res., 2015

Multi-factory parallel machine problems: Improved mathematical models and artificial bee colony algorithm.
Comput. Ind. Eng., 2015

Modeling and solving the project selection and scheduling.
Comput. Ind. Eng., 2015

A novel imperialist competitive algorithm for generalized traveling salesman problems.
Appl. Soft Comput., 2015

2014
Pricing decisions for complementary products with firm's different market powers in fuzzy environments.
J. Intell. Fuzzy Syst., 2014

Polynomial time approximation algorithms for proportionate open-shop scheduling.
Int. Trans. Oper. Res., 2014

Multi-objective job shop scheduling problem with sequence dependent setup times using a novel metaheuristic.
Int. J. Intell. Eng. Informatics, 2014

Modeling and heuristics for scheduling of distributed job shops.
Expert Syst. Appl., 2014

A scatter search algorithm for the distributed permutation flowshop scheduling problem.
Eur. J. Oper. Res., 2014

Multiple cross-docks scheduling using two meta-heuristic algorithms.
Comput. Ind. Eng., 2014

A hybrid multi-population genetic algorithm for the dynamic facility layout problem.
Appl. Soft Comput., 2014

2011
Scheduling open shops with parallel machines to minimize total completion time.
J. Comput. Appl. Math., 2011

Clustering and ranking university majors using data mining and AHP algorithms: A case study in Iran.
Expert Syst. Appl., 2011

Incorporating periodic preventive maintenance into flexible flowshop scheduling problems.
Appl. Soft Comput., 2011

2010
Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan.
Knowl. Based Syst., 2010

Algorithms for a realistic variant of flowshop scheduling.
Comput. Oper. Res., 2010

The distributed permutation flowshop scheduling problem.
Comput. Oper. Res., 2010

A contribution and new heuristics for open shop scheduling.
Comput. Oper. Res., 2010

A high performing metaheuristic for job shop scheduling with sequence-dependent setup times.
Appl. Soft Comput., 2010

An electromagnetism-like metaheuristic for sequence dependent open shop scheduling.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

A bi-objective case of no-wait flowshops.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2009
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., 2009

A study on integrating sequence dependent setup time flexible flow lines and preventive maintenance scheduling.
J. Intell. Manuf., 2009

A variable neighborhood search for job shop scheduling with set-up times to minimize makespan.
Future Gener. Comput. Syst., 2009

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., 2009

Modeling and scheduling a case of flexible flowshops: Total weighted tardiness minimization.
Comput. Ind. Eng., 2009

A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time.
Comput. Ind. Eng., 2009


  Loading...