# B. Naderi

According to our database

Collaborative distances:

^{1}, B. Naderi authored at least 43 papers between 2009 and 2019.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2019

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

Computers & OR, 2019

An optimization model of three-player payoff based on fuzzy game theory in green supply chain.

Computers & Industrial Engineering, 2019

2018

Bi-objective optimization of a job shop with two types of failures for the operating machines that use automated guided vehicles.

Rel. Eng. & Sys. Safety, 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.

Computers & Chemical Engineering, 2018

A preemptive fuzzy goal programming model for generalized supplier selection and order allocation with incremental discount.

Computers & Industrial Engineering, 2018

Portfolio rebalancing with respect to market psychology in a fuzzy environment: A case study in Tehran Stock Exchange.

Appl. Soft Comput., 2018

2017

Truck routing and scheduling for cross-docking in the supply chain: model and solution method.

RAIRO - Operations Research, 2017

Solving a fuzzy multi objective model of a production-distribution system using meta-heuristic based approaches.

J. Intelligent Manufacturing, 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.

APJOR, 2017

2016

New formulations for the setup assembly line balancing and scheduling problem.

OR Spectrum, 2016

An improved mathematical model and a hybrid metaheuristic for truck scheduling in cross-dock problems.

Computers & Industrial Engineering, 2016

Supply chain networks design with multi-mode demand satisfaction policy.

Computers & Industrial Engineering, 2016

Optimal decisions in a dual-channel supply chain under simultaneous demand and production cost disruptions.

Annals OR, 2016

2015

A novel chaotic imperialist competitive algorithm for production and air transportation scheduling problems.

Neural Computing and Applications, 2015

A Model and Metaheuristic for Truck Scheduling in Multi-door Cross-dock Problems.

Intelligent Automation & Soft Computing, 2015

The type E simple assembly line balancing problem: A mixed integer linear programming formulation.

Computers & OR, 2015

Multi-factory parallel machine problems: Improved mathematical models and artificial bee colony algorithm.

Computers & Industrial Engineering, 2015

Modeling and solving the project selection and scheduling.

Computers & Industrial Engineering, 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.

Journal of Intelligent and Fuzzy Systems, 2014

Polynomial time approximation algorithms for proportionate open-shop scheduling.

ITOR, 2014

Multi-objective job shop scheduling problem with sequence dependent setup times using a novel metaheuristic.

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

European Journal of Operational Research, 2014

Multiple cross-docks scheduling using two meta-heuristic algorithms.

Computers & Industrial Engineering, 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. Computational Applied Mathematics, 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.

Computers & OR, 2010

The distributed permutation flowshop scheduling problem.

Computers & OR, 2010

A contribution and new heuristics for open shop scheduling.

Computers & OR, 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. Intelligent Manufacturing, 2009

A variable neighborhood search for job shop scheduling with set-up times to minimize makespan.

Future Generation Comp. 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.

Computers & Industrial Engineering, 2009

A hybrid artificial immune algorithm for a realistic variant of job shops to minimize the total completion time.

Computers & Industrial Engineering, 2009