نتایج جستجو برای: sequencing problem
تعداد نتایج: 1002313 فیلتر نتایج به سال:
Abstract We investigate an important research question for solving the car sequencing problem, that is, which characteristics make instance hard to solve? To do so, we carry out space analysis by extracting a vector of problem features characterize instance. In order visualize space, feature vectors are projected onto 2-D using dimensionality reduction techniques. The resulting visualizations p...
there are many approaches for solving variety combinatorial optimization problems (np-compelete) that devided to exact solutions and approximate solutions. exact methods can only be used for very small size instances due to their expontional search space. for real-world problems, we have to employ approximate methods such as evolutionary algorithms (eas) that find a near-optimal solution in a r...
Despite existing various integer programming for sequencing problems, there is not enoughinformation about practical values of the models. This paper considers the problem of minimizing maximumlateness with release dates and presents four different mixed integer programming (MIP) models to solve thisproblem. These models have been formulated for the classical single machine problem, namely sequ...
this article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. the objective is to minimize the makespan for a given set of jobs in the system. this problem class is np-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. a number of test problems are randomly ge...
hearing loss (hl) is the most common communication disorder affecting about 1/1000 births worldwide caused by environmental or genetic factors. about 30-50% is attributed to genetic factors and till now more than 85 genes have been implicated in non-syndromic hl. in iran, hl is second to intellectual disability as the most common disability, affecting 1 of every 166 persons. about 15 years ago ...
This article addresses a multi-stage flowshop scheduling problem with equal number of unrelated parallel machines. The objective is to minimize the makespan for a given set of jobs in the system. This problem class is NP-hard in the strong sense, so a hybrid heuristic method for sequencing and then allocating operations of jobs to machines is developed. A number of test problems are randomly ge...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید