Results 261 to 270 of about 7,585,843 (289)
Some of the next articles are maybe not open access.
A memetic algorithm for solving flexible Job-Shop Scheduling Problems
2014 IEEE Congress on Evolutionary Computation (CEC), 2014The flexible Job-shop Scheduling Problem (FJSP) is an extension of the classical job-shop scheduling problem (JSP). In this paper, a memetic algorithm (MA) for the FJSP is presented. This MA is a hybrid genetic algorithm which explores the search space and two efficient local searchers to exploit information in the search region.
Wenping Ma 0001 +4 more
openaire +2 more sources
Iterative Flattening Search for the Flexible Job Shop Scheduling Problem
2011This paper presents a meta-heuristic algorithm for solving the Flexible Job Shop Scheduling Problem (FJSSP). This strategy, known as Iterative Flattening Search (IFS), iteratively applies a relaxation-step, in which a subset of scheduling decisions are randomly retracted from the current solution; and a solving-step, in which a new solution is ...
Oddi Angelo +3 more
openaire +2 more sources
A Reinforcement Learning Approach for the Flexible Job Shop Scheduling Problem
2011In this work we present a Reinforcement Learning approach for the Flexible Job Shop Scheduling problem. The proposed approach follows the ideas of the hierarchical approaches and combines learning and optimization in order to achieve better results. Several problem instances were used to test the algorithm and to compare the results with those reported
Yailen Martínez-Jiménez +3 more
openaire +3 more sources
A Hybrid and Flexible Genetic Algorithm for the Job-Shop Scheduling Problem
2007 International Symposium on Computational Intelligence in Robotics and Automation, 2007A hybrid and flexible genetic algorithm (HybFlexGA) is presented for the job-shop scheduling problem (JSSP). The JSSP is one of the most difficult production scheduling problems in industry because it requires very large combinational search space and the precedence constraint between machines.
António Ferrolho, Manuel M. Crisóstomo
openaire +2 more sources
An artificial immune algorithm for the flexible job-shop scheduling problem
Future Generation Computer Systems, 2010This article addresses the flexible job-shop scheduling problem (FJSP) to minimize makespan. The FJSP is strongly NP-hard and consists of two sub-problems. The first one is to assign each operation to a machine out of a set of capable machines, and the second one deals with sequencing the assigned operations on all machines.
Ali Bagheri +3 more
openaire +1 more source
Flexible Job-Shop Scheduling Problems
2005Planning and scheduling problems in various industrial environments are combinatorial and very difficult. Generally, it is extremely hard to solve these types of problems in their general form. Scheduling can be formulated as a problem of determining the best sequence to execute a set of tasks on a set of resources, respecting specific constraints like
openaire +2 more sources
An integrated greedy heuristic for a flexible job shop scheduling problem
2001 IEEE International Conference on Systems, Man and Cybernetics. e-Systems and e-Man for Cybernetics in Cyberspace (Cat.No.01CH37236), 2002The job shop scheduling problem (JSP) deals with the sequencing operations of a set of jobs on a set of machines with minimum cost. The flexible job shop scheduling problem (FJSP) is a generalization of the JSP, which is concerned with both the assignment of machines to operations and the sequencing of the operations on the assigned machines. The paper
Yazid Mati, Nidhal Rezg, Xiaolan Xie
openaire +2 more sources
Reactive scheduling approach for solving a realistic flexible job shop scheduling problem
International Journal of Production Research, 2020Reactive Scheduling (RS) and the realistic Flexible Job Shop Scheduling Problem (FJSSP) are of major importance for the implementation of real-world manufacturing systems.
Bachir Mihoubi +2 more
openaire +2 more sources
Simultaneous Scheduling Strategy: A Novel Method for Flexible Job Shop Scheduling Problem
2020 IEEE Congress on Evolutionary Computation (CEC), 2020This paper discussed the contradictory between wait time for computation and solution quality in solving flexible job shop scheduling problems. In order to reconcile this contradictory, a novel scheduling strategy called Simultaneous Scheduling is proposed.
Bo Liu, Siqi Qiu, Ming Li 0055
openaire +2 more sources
A fast genetic algorithm for the flexible job shop scheduling problem
Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, 2014This paper presents a fast genetic algorithm (GA) for solving the flexible job shob scheduling problem (FJSP). The FJSP is an extension of a classical NP-hard job shop scheduling problem. Here, we combine the active schedule constructive crossover (ASCX) with the generalized order crossover (GOX).
Marcin Cwiek, Jakub Nalepa
openaire +1 more source