Results 121 to 130 of about 926 (160)
Some of the next articles are maybe not open access.
Researches on Flexible Job-Shop Scheduling Problem
2009 Fifth International Conference on Natural Computation, 2009Evolutionary algorithms (EAs) prove to be powerful in solving combinatorial optimization problems. A symbiotic evolutionary algorithm is applied to deal with complex job-shop scheduling problem (JSP). An efficient crossover, Merge and Split Recombination crossover (MSX) which always produces feasible offspring and enhances population diversity and ...
Zhaofeng Su, Hongze Qiu
openaire +1 more source
Flexible job-shop scheduling problem under resource constraints
International Journal of Production Research, 2006A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be ...
Wong, TC, Chan, FTS, Chan, LY
openaire +3 more sources
A Taxonomy for the Flexible Job Shop Scheduling Problem
2015This chapter aims at developing a taxonomic framework to classify the studies on the flexible job shop scheduling problem (FJSP). The FJSP is a generalization of the classical job shop scheduling problem (JSP), which is one of the oldest NP-hard problems. Although various solution methodologies have been developed to obtain good solutions in reasonable
Cinar, Didem +2 more
openaire +2 more sources
Immune genetic algorithm for flexible job-shop scheduling problem
2010 IEEE International Conference on Automation and Logistics, 2010An kind of immune genetic algorithm(IGA) is proposed for solving the flexible job-shop scheduling problem(FJSP). Based on the globalsearching method of classic genetic algorithm (SG), and using the diversity preservation strategy of antibodies in biology immunity mechanism, the method greatly improves the colony diversity of GA and compared to genetic ...
null Jia Ma +2 more
openaire +1 more source
Hierarchical Optimization for the Flexible Job Shop Scheduling Problem
IFAC Proceedings Volumes, 2004Abstract In this paper we propose a new approach for the flexible job shop scheduling problem. This approach is based on the decomposition of the problem in an assignrnent problem and a sequencing probleln. The first part is ensured by an assignment technique based successively on a heuristic approach and a local search.
N. Zribi, I. Kacem, A. El Kamel
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
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 ...
Zuo, Yi, Gong, Maoguo, Jiao, Licheng
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.
B. Mihoubi, B. Bouzouia, M. Gaham
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
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
openaire +1 more source