Results 301 to 310 of about 3,948 (333)
Some of the next articles are maybe not open access.
Adaptive multimeme algorithm for flexible job shop scheduling problem
Natural Computing, 2016In this paper, we propose an adaptive multimeme algorithm (AMMA) to address the flexible job shop scheduling problem (FJSP) with the objective to minimize the makespan. The search operator is modeled as a synergy of genetic and memetic mechanisms through integrating a stochastic variation and a local search procedure into a composite operator for each ...
Yi Zuo 0002, Maoguo Gong, Licheng Jiao
openaire +1 more source
Bottleneck Identification of Extended Flexible Job Shop Scheduling Problem
2018 6th International Symposium on Computational and Business Intelligence (ISCBI), 2018In the Extended Flexible Job Shop Scheduling Problem (EFJSP), the temporal constraints among the tasks could be very complex including serial, parallel and flexible relations. This paper presents a method for identifying the critical tasks that affect the makespan most remarkably, which we call the "bottleneck tasks". To this end, we first transfer the
Yunfei Wang +5 more
openaire +1 more source
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
A hybrid algorithm for scheduling in job shop problem with flexible resources
IEEE ICCA 2010, 2010Flexible resource has become very important in today's competitive environment. The improvements in manufacturing efficiency can be achieved by the use of optimal scheduling to max the potential power of flexible resource. In this paper, we formulate the Job Shop Flexible Resource Scheduling (JSFRS) problem in which the job operation processing times ...
Wei Wu, Junhu Wei, Xiaohong Guan
openaire +1 more source
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
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 +1 more source
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 +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 +1 more source
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 +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