Hany Seidgar

TL;DR: In this article, the authors considered a two-stage assembly flow shop problem where m parallel machines are in the first stage and an assembly machine is in the second stage, and employed an imperialist competitive algorithm (ICA) as solution approach.

TL;DR: A new bi-objective-mixed integer linear programming model for BPM in which arbitrary job size, unequal release time and capacity limits are considered as realistic assumptions occur in the manufacturing environments is presented.

TL;DR: A new bi-objective mixed integer programming model is presented for the two-stage assembly flow shop scheduling problem with preventive maintenance activities, in which the reliability/availability approach is employed to model the maintenance concepts of a problem.

TL;DR: In this paper, the authors proposed two meta-heuristic algorithms, namely, imperialist competitive algorithm and genetic algorithm, to obtain solutions of the two-stage assembly flow shop problem considering preventive maintenance activities and machine breakdowns.

TL;DR: In this article, a new mathematical model is developed for a multi-depot vehicle routing problem with simultaneous pickup and delivery, where a non-homogenous fleet of vehicles and a number of drivers with different levels of capability are employed to service customers with pickup/delivery demands.