If there is a continuous flow of production jobs for some machines, the problem of flow shop scheduling arises. As mentioned in many researches, the complexities of this problem are of exponential kind; therefore it is necessary to design less complex methods or algorithms for solving it. In this paper, a new solution is presented for this kind of scheduling problem by using the idea of neural ...

This paper  presents a new multi objective job shop scheduling with sequence-dependent setup times. The objectives are to minimize the makespan and sum of the earliness and tardiness of jobs in a time window. A mixed integer programming model is developed for the given problem that belongs to NP-hard class. In this case, traditional approaches cannot reach to an optimal solution in a reasonable...

Important advances in rapid magnetic resonance (MR) imaging technology and its application to cardiovascular imaging have been made during the past decade. High-field-strength clinical magnets, high-performance gradient hardware, and ultrafast pulse sequence technology are rapidly making the vision of a comprehensive "one-stop shop" cardiac MR imaging examination a reality. This examination is ...

An effective job shop scheduling (JSS) in the manufacturing industry is helpful to meet production demand and reduce cost, improve ability compete ever increasing volatile market demanding multiple products.In so many combinatorial optimization problems, problems have earned a reputation for being difficult solve. Job-shop essentially an ordering problem. A new encoding scheme classic job-shop ...

this paper considers the problem of scheduling hybrid flowshops with machine availability constraints (mac) to minimize makespan. the paper deals with a specific case of mac caused by preventive maintenance (pm) operations. contrary to previous papers considering fixed or/and conservative policies, we explore a case in which pm activities might be postponed or expedited while necessary. regardi...

in this paper, we generalize a theorem of shao [12] by assuming that is a sequence of linear negatively dependent random variables. also, we extend some theorems of chao [6] and thrum [14]. it is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of real numbe...

proper scheduling of tasks leads to optimum using of time and resources, inorder to obtaining best result. one of the most important and complicatedscheduling problems is open shop scheduling problem. there are n jobs in openshop scheduling problem which should be processed by m machines. purpose ofscheduling open shop problem is attaining to a suitable order of processing jobs byspecified mach...

Customer behavior mining in shopping activates is important from two perspectives namely, the perspective supplier of goods and the perspective of shop owners. Both groups want to know that their customers’ interest in which goods and identify which sequence of the goods that are most popular. The latter group will even change the manner of arrangements of goods in their shops, manner of good o...

We describe an Ant Colony Optimization (ACO) algorithm for solving a single machine scheduling problem. In the operating situation modeled, setup times are sequence dependent and the objective is to minimize total tardiness. This problem has previously been treated by Rubin & Ragatz [1995] and by Tan et al. [2000] among others. A new feature using look-ahead information in the transition rule o...