Mohammadreza Dabiri; Mehdi Yazdani; bahman naderi; Hasan Haleh
Abstract
In the real world, firms with hybrid flow-shop manufacturing environment generally facethe human resource constraint, salary cost increasment and efforts to make better use oflabor, in addition to machine constraint. Given the limitations of these resources, productdelivery requierements to customers ...
Read More
In the real world, firms with hybrid flow-shop manufacturing environment generally facethe human resource constraint, salary cost increasment and efforts to make better use oflabor, in addition to machine constraint. Given the limitations of these resources, productdelivery requierements to customers have made the job rejection essential in order to meetdistinct customer requirements. Therefore, this research has studied the dual resourceconstrained hybrid flow-shop scheduling problem with job rejection in order to minimizethe total net cost (the sum of the total rejection cost and the total tardiness cost of jobs)which is widely used in many industries. In this article, a mixed integer linear programmingmodel has developed for the research problem. In addition, an improved sooty ternoptimization algorithm (ISTOA) has proposed to solve the large-sized problems as well asa decoding method due to the NP-hardness of the problem. In order to evaluate theproposed optimization algorithm, five well-known algorithms in the literature including(immunoglobulin-based artificial immune system (IAIS), genetic algorithm (GA), discreteartificial bee colony (DABC), improved fruit fly optimization (IFFO), effective modifiedmigrating birds optimization (EMBO)) have adapted with the proposed problem. Finally,the performance of the proposed optimization algorithm has investigated against theadapted algorithms. Results and evaluations show the good performance of the improvedsooty tern optimization algorithm.
Mehdi Yazdani
Abstract
This paper deals with the problem of two-stage assembly flow shop scheduling with considering sequence-independent setup times .The objective is to minimize totalcompletion times of all orders. In this problem, there are several orders for one type of product. Each ordered product is formed of several ...
Read More
This paper deals with the problem of two-stage assembly flow shop scheduling with considering sequence-independent setup times .The objective is to minimize totalcompletion times of all orders. In this problem, there are several orders for one type of product. Each ordered product is formed of several different parts. At first, the parts are manufactured in a flow shop stage with some different machines and then they are assembled into a final product on a single machine. This paper presents three meta-heuristic algorithms, namely Parallel Variable Neighborhood Search (PVN) Artificial Immune Algorithm (AIA) and Simulated Annealing (SA), for solving under studied problem. The Taguchi experimental design method as an optimization technique is employed to tune different parameters and operators of presented algorithms. Also, Numerical experiments are used to evaluate the performance of the proposed algorithms. The results show that the PVNS algorithm performs better than the other algorithms
Mehdi Yazdani; Bahman Naderi
Abstract
In the scheduling problems, it is commonly assumed that processing times are fixed and known. In the literature of project scheduling emphasizes that the time of each activity/operation can be multi-mode and by assigning more resources, the activity time can be reduced. In these problems, in addition ...
Read More
In the scheduling problems, it is commonly assumed that processing times are fixed and known. In the literature of project scheduling emphasizes that the time of each activity/operation can be multi-mode and by assigning more resources, the activity time can be reduced. In these problems, in addition to activity scheduling, allocation of available limited resources to the activities should also be carried out. This assumption that processing time of activities is fixed is a weakness in scheduling literature. This paper develops the classic problem flow shop scheduling to multi-mode resource-cosntrainted flow shop scheduling problem. This paper discusses comprehensively about mathematical modeling. In this regard, two mixed integer linear programming models with two differnet concepts are presented. The first model is location-based model and the second is sequence-based. The performance of the models are evaluated by comparing their size and computational complexities. In the size complexity, the first model requires more variables but less constraints than second Model. In the computational complexity, the first model significantly outperforms than the second Model. Also, the first model, besides solving more problems as optimally, requires less time to solve than the second model
Mehdi Yazdani; Mostafa Zandieh; Reza Tavakkoli-Moghaddam
Volume 12, Issue 33 , July 2015, , Pages 43-74
Abstract
In this paper, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) with objective of minimizing the makespan is investigated. Under studied problem is NP-hard and mainly includes three sub-problems. The first one is to assign each operation to a machine out ...
Read More
In this paper, the dual-resource constrained flexible job-shop scheduling problem (DRCFJSP) with objective of minimizing the makespan is investigated. Under studied problem is NP-hard and mainly includes three sub-problems. The first one is to assign each operation to a machine out of a set of capable machines, the second one is to determine a worker among a set of skilled workers for processing each operation on the selected machine and the third one deals with sequencing the assigned operations on the machines considering workers in order to optimize the performance measure. In this paper, we provide a mathematical model for this problem and then propose a hybrid meta-heuristic algorithm for solving the problem. The proposed hybrid algorithm uses variable neighborhood search and simulated annealing algorithms to search in the solution space. Computational study with randomly generated test problems is performed to evaluate the performance of the proposed algorithm. The results show the proposed algorithms are effective approaches for solving the DRCFJSP.
Mehdi Yazdani; Mahshid Aioobi; Amin Ghoroori
Volume 8, Issue 21 , June 2011, , Pages 131-142
Abstract
Some real world problems include determining optimum values of lput variables in order to obtain the desired levels of output variable response surface variable). One of the applicable techniques which are set for modeling and solving such problems is Response Surface methodology (RSM). In this paper, ...
Read More
Some real world problems include determining optimum values of lput variables in order to obtain the desired levels of output variable response surface variable). One of the applicable techniques which are set for modeling and solving such problems is Response Surface methodology (RSM). In this paper, the effect of three controllable lput factors: temperature, the density of sodium cyanide, and ampere n the determined response surface level i.e. the thickness of the electroplating cover of a hook screw is checked by Design Of experiments (DOE). After the execution of experiments and the ^cognition of effective factors, according to the application of response surface methodology, the relationship between the variables f effective input factors and the response surface variable is stermined with the help of nonlinear regression model. Then, the Optimum value of each variable in nonlinear model is obtained by goal pogromming method.