M
Mehdi Mahnam
Researcher at Isfahan University of Technology
Publications - 17
Citations - 511
Mehdi Mahnam is an academic researcher from Isfahan University of Technology. The author has contributed to research in topics: Branch and bound & Tardiness. The author has an hindex of 7, co-authored 14 publications receiving 445 citations. Previous affiliations of Mehdi Mahnam include Amirkabir University of Technology & École Polytechnique de Montréal.
Papers
More filters
Journal ArticleDOI
A Pareto approach to multi-objective flexible job-shop scheduling problem using particle swarm optimization and local search
Ghasem Moslehi,Mehdi Mahnam +1 more
TL;DR: In this paper, a hybrid approach based on a hybridization of the particle swarm and local search algorithm is proposed to solve the multi-objective flexible job shop scheduling problem, which is an extension of the job shop problem that allows an operation to be processed by any machine from a given set along different routes.
Journal ArticleDOI
Supply chain modeling in uncertain environment with bi-objective approach
TL;DR: An inventory model for an assembly supply chain network (each unit has at most one immediate successor, but any number of immediate predecessors) which fuzzy demand for single product in one hand and fuzzy reliability of external suppliers in other hand affect on determination of inventory policy in SCM is developed.
Journal ArticleDOI
Guided local search algorithm for hot strip mill scheduling problem with considering hot charge rolling
TL;DR: In this paper, the hot strip mill scheduling problem is formulated using the prize collecting vehicle routing problem. And a search algorithm is developed that consists of three major phases including separation of slabs that can be scheduled, generation of an initial solution, and improvement of the solution.
Journal ArticleDOI
Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness
TL;DR: In this paper, an exact branch-and-bound scheme is proposed to sequence the jobs by means of efficient dominance rules, lower and upper bounds, and a polynomial time algorithm to optimally minimize the objective function is developed to insert idle times and schedule the known sequence of jobs in each node of the search tree.
Journal ArticleDOI
A branch-and-bound algorithm to minimise the sum of maximum earliness and tardiness in the single machine
TL;DR: This paper considers the problem of scheduling n jobs on a single machine to minimise the sum of maximum earliness and tardiness, and proposes a branch-and-bound scheme that is consistent with the just-in-time production system.