نتایج جستجو برای: job shop
تعداد نتایج: 78031 فیلتر نتایج به سال:
Scheduling is a combinatorial problem with important impact on both industry and commerce. If it is performed well it yields time and efficiency benefits and hence reduces costs. Genetic Algorithms have been applied to solve several types of scheduling problems; Flow Shop, Resource, Staff and Line Balancing have all been tackled. However Jobshop Scheduling is the most common problem of interest...
This paper introduces a modified shifting bottleneck approach to solve train scheduling and rescheduling problems. The problem is formulated as a job shop scheduling model and a mixed integer linear programming model is also presented. The shifting bottleneck procedure is a wellestablished heuristic method for obtaining solutions to the job shop and other machine scheduling problems. We modify ...
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been applied to the Dynamic Job Shop Scheduling Problem (DJSSP) which is more similar to real-world applications. We implement a hybrid genetic algorithm for solving the dynamic job shop problem. A direct chromosome representati...
A recent adaptive algorithm, named Ant System, is introduced and used to solve the problem of job shop scheduling. The algorithm was first introduced by Dorigo, Maniezzo and Colorni in 1991 and is derived from the foraging and recruiting behaviour observed in an ant colony. It can be applied to combinatorial optimisation problems. This paper outlines the algorithm’s implementation and performan...
The concurrent open shop problem is a relaxation of the well known open job shop problem, where the components of a job can be processed in parallel by dedicated, component specific machines. Recently, the problem has attracted the attention of a number of researchers. In particular, Leung et al. (2005) show, contrary to the assertion in Wagneur and Sriskandarajah (1993), that the problem of mi...
A flow shop scheduling problem involves scheduling jobs on multiple machines in series in order to optimize a given criterion. The flow time of a job is the amount of time the job spent before its completion and the stretch of the job is the ratio of its flow time to its processing time. In this paper, a hybrid genetic algorithm (HGA) approach is proposed for minimizing the total stretch in flo...
Meeting due dates is the most important goal of scheduling if the due date of each job has been promised to its customer. This paper considers the job-shop scheduling problem of minimizing the total holding cost of completed and in-process products subject to no tardy jobs. A heuristic algorithm based on the shifting bottleneck procedure is proposed for solving the minimum total holding cost pr...
The Group Shop Scheduling Problem (GSP) is a generalization of the classical Job Shop and Open Shop Scheduling Problems. In the GSP there are m machines and n jobs. Each job consists of a set of operations, which must be processed on specified machines without preemption. The operations of each job are partitioned into groups on which a total precedence order is given. The problem is to order t...
The majority of the research using evolutionary algorithms for the Job Shop Scheduling Problem (JSSP) has studied only the static JSSP. Few evolutionary algorithms have been applied to the Dynamic Job Shop Scheduling Problem (DJSSP) which is more similar to real-world applications. We implement a hybrid genetic algorithm for solving the dynamic job shop problem. A direct chromosome representati...
Flexible job shop scheduling problem (FJSP) is an important extension of the classical job shop scheduling problem, where the same operation could be processed on more than one machine. A Variable Neighborhood Genetic Algorithm (VNGA) is proposed for the problem with makespan criterion, consisting of a combination of the variable neighborhood search (VNS) and genetic algorithm (GA). Variable ne...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید