Results 301 to 310 of about 67,803 (347)
Some of the next articles are maybe not open access.
Flexible job shop scheduling with blockages
Mathematical Methods of Operations Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hansmann, R. S. +2 more
openaire +2 more sources
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 +3 more
openaire +1 more source
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
Flexible job‐shop scheduling problem by genetic algorithm
Electrical Engineering in Japan, 2009AbstractThe Flexible Job‐shop Scheduling Problem is an expansion of the traditional Job‐shop Scheduling Problem in which an operation can be processed by one or more machines. The purpose of this problem is to look for the smallest makespan. For that purpose, it is necessary to decide the optimal assignment of machines to operations and the order of ...
Kenichi Ida, Kensaku Oka
openaire +1 more source
Multiobjective Flexible Job Shop Scheduling Using Memetic Algorithms
IEEE Transactions on Automation Science and Engineering, 2015In this paper, we propose new memetic algorithms (MAs) for the multiobjective flexible job shop scheduling problem (MO-FJSP) with the objectives to minimize the makespan, total workload, and critical workload. The problem is addressed in a Pareto manner, which aims to search for a set of Pareto optimal solutions.
Hua Xu, Yuan Yuan
openaire +1 more source
Review for Flexible Job Shop Scheduling
2020Flexible Job shop Scheduling Problem (FJSP) is an NP-hard combinatorial optimization problem, which has significant applications in the real world. Due to the complexity and significance, lots of attention have been attracted to tackle this problem. In this paper, the existing solution methods for the FJSP in the recent literature are classified into ...
Xinyu Li, Liang Gao
openaire +1 more source
Hybrid frameworks for flexible job shop scheduling
The International Journal of Advanced Manufacturing Technology, 2020Effective scheduling is essential for manufacturing firms to survive in today’s fiercely competitive marketplace. Improvisation of schedule by simultaneous optimization of the performance measures is imperative for the manufacturing firms to stay ahead of competition and is one of the key responsibilities of shop floor managers.
Puja Bharti, Sushma Jain
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, Hongze Qiu
openaire +1 more source
Evaluating Schedule Performance in Flexible Job-Shops
2004In this paper, we are interested in the multi-objective evaluation 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.
Kacem, Imed, Borne, Pierre
openaire +2 more sources
Scheduling flexible job shops under workforce constraints
2021Scheduling problems are of high relevance in various application areas, especially in production and logistic environments. A well-known problem setting is the job shop scheduling problem that occurs in traditional manufacturing systems. Modern manufacturing systems, however, are usually more complex and feature multi-purpose machines that allow to ...
openaire +1 more source