scispace - formally typeset
S

S. Afshin Mansouri

Researcher at Brunel University London

Publications -  32
Citations -  3054

S. Afshin Mansouri is an academic researcher from Brunel University London. The author has contributed to research in topics: Job shop scheduling & Supply chain. The author has an hindex of 21, co-authored 30 publications receiving 2487 citations. Previous affiliations of S. Afshin Mansouri include University of Tehran & King's College London.

Papers
More filters
Journal ArticleDOI

Search-based software engineering: Trends, techniques and applications

TL;DR: The work identifies research trends and relationships between the techniques applied and the applications to which they have been applied and highlights gaps in the literature and avenues for further research.
Journal ArticleDOI

The relationship between green supply chain management and performance: A meta-analysis of empirical evidences in Asian emerging economies

TL;DR: In this article, the relationship between green supply chain management (GSCM) practices and firm performance in the manufacturing sector in Asian emerging economies (AEE) based on empirical evidence is analyzed.
Proceedings ArticleDOI

The multi-objective next release problem

TL;DR: The paper presents the results of an empirical study into the suitability of weighted and Pareto optimal genetic algorithms, together with the NSGA-II algorithm, presenting evidence to support the claim that NS GA-II is well suited to the MONRP.
Journal ArticleDOI

Green scheduling of a two-machine flowshop: Trade-off between makespan and energy consumption

TL;DR: This paper develops a mixed integer linear multi-objective optimization model and develops a constructive heuristic for fast trade-off analysis between makespan and energy consumption, which can serve as a visual aid for production and sales planners to consider energy consumption explicitly in making quick decisions while negotiating with customers on due dates.
Journal ArticleDOI

A Multi-Objective Genetic Algorithm for mixed-model sequencing on JIT assembly lines

TL;DR: Experimental results show that the MOGA performs very well when compared against TE in a considerably shorter time, and outperforms the comparator algorithms in terms of quality of solutions at the same level of diversity in reasonable amount of CPU time.