Results 291 to 300 of about 3,948 (333)
Some of the next articles are maybe not open access.
The generalized flexible job shop scheduling problem
Computers & Industrial Engineering, 2021Abstract In this work, we introduce a generalized flexible job-shop scheduling problem in which, besides the classical constraints of the flexible job shop scheduling problem other hard constraints such as machine capacity, time lags, holding times, and sequence-dependent setup times are taken into account.
Vincent Boyer 0002 +3 more
openaire +1 more source
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 0002, Hongze Qiu
openaire +1 more source
Flexible Job-Shop Scheduling Problems
2003The Job-shop Scheduling Problem (JSP) is one of hardest problems; it is classified NP-complete (Carlier & Chretienne, 1988; Garey & Johnson, 1979). In the most part of cases, the combination of goals and resources can exponentially increase the problem complexity, because we have a very large search space and precedence constraints between ...
Imed Kacem, Slim Hammadi, Pierre Borne
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
Scheduling complex flexible job shop problems
Proceedings 1995 INRIA/IEEE Symposium on Emerging Technologies and Factory Automation. ETFA'95, 2002We are developing for some years scheduling softwares for chemical industry. These softwares (developed on C++) are based on heuristics combined with optimisation methods. Our aim is to design a general methodology to cope with a large class of flexible job shop problems.
H. El Maqrini, J. Teghem
openaire +1 more source
On the Impact of Transport Times in Flexible Job Shop Scheduling Problems
2022 IEEE 27th International Conference on Emerging Technologies and Factory Automation (ETFA), 2022Manufacturing systems require a careful scheduling of the resource usage to maximize the production efficiency. In a completely automated environment, the transport system should be orchestrated to work smoothly with the other resources. While the impact of job characteristics, such as fixed or variable processing times of the tasks composing the jobs,
Gaiardelli, Sebastiano +3 more
openaire +1 more source
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 +1 more source
Genetic algorithm for the flexible job-shop scheduling problem
SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483), 2004In this paper, we are interested in the multiobjective optimization of the schedule performance in the flexible job shops. The flexible job shop scheduling problem (FJSP) is known in the literature as one of the hardest combinatorial optimization problems and presents many objectives to be optimized.
openaire +1 more source
An efficient genetic algorithm for flexible job-shop scheduling problem
2014 IEEE International Conference on Industrial Engineering and Engineering Management, 2014In this paper a genetic algorithm (GA) is developed to create a feasible and active schedule for the flexible job-shop scheduling problems with the aims of minimizing completion time of all jobs, i.e. makespan. In the proposed algorithm, an enhanced solution coding is used.
Ali Mokhtari Moghadam +2 more
openaire +1 more source
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 +1 more source