This paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems. In the hybrid approach, GA is used to iterate for searching optimal solutions, CSANN is used to obtain feasible solutions during the iteration of genetic algorithm. Simulations have shown the valid performance of the proposed hybrid approach ...

A hybrid genetic algorithm (HGA) approach is proposed for a lot-streaming flow shop scheduling problem, in which a job (lot) is split into a number of smaller sublots so that successive operations can be overlapped. The objective is the minimization of the mean weighted absolute deviation of job completion t imes from due dates.

the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...

This paper introduces a hybrid genetic algorithm-microscopic traffic simulation methodology for scheduling of pavement maintenance activities involving lane closures aiming to minimize network traffic delay. Genetic algorithm is implemented as an optimization tool for the generation and selection of maintenance schedules. For each possible schedule, a microscopic traffic simulation model is use...

although lot streaming scheduling is an active research field, lot streaming flexible flow lines problems have received far less attention than classical flow shops. this paper deals with scheduling jobs in lot streaming flexible flow line problems. the paper mathematically formulates the problem by a mixed integer linear programming model. this model solves small instances to optimality. moreo...

In flow shop scheduling there are m machines and n jobs, such that every job has to be processed on the machines in the fixed order 1, . . . , m. In the permutation flow shop problem, it is also required that each machine processes the set of all jobs in the same order. Formally, given n jobs along with their processing times on each machine, the goal is to compute a single permutation of the j...

This paper addresses the multi-mode multi-skilled resource-constrained project scheduling problem. Activities of real world projects often require more than one skill to be accomplished. Besides, in many real-world situations, the resources are multi-skilled workforces. In presence of multi-skilled resources, it is required to determine the combination of workforces assigned to each activity. H...