Results 221 to 230 of about 22,784 (309)
Some of the next articles are maybe not open access.
Flexible Job-Shop Scheduling in Smart Manufacturing
2021 IEEE 7th International Conference on Control Science and Systems Engineering (ICCSSE), 2021Production scheduling problems encountered more complexity with the digital manufacturing. Classic Flexible Job Shop Scheduling (FJSSP) gained dynamic manner due to the alternative process planning abled to machine the same part with different routing of one job. A single job is a routing processing operations done on a sequencing features.
Mohamed Ahmed Awad +1 more
openaire +1 more source
IEEE Transactions on Evolutionary Computation, 2023
Green flexible job-shop scheduling problem (FJSP) aims to improve profit and reduce energy consumption for modern manufacturing. Meanwhile, FJSP with type-2 fuzzy processing time is proposed to predict the uncertainty in timing constraint for better ...
Rui Li, Wenyin Gong, Chao Lu, Ling Wang
semanticscholar +1 more source
Green flexible job-shop scheduling problem (FJSP) aims to improve profit and reduce energy consumption for modern manufacturing. Meanwhile, FJSP with type-2 fuzzy processing time is proposed to predict the uncertainty in timing constraint for better ...
Rui Li, Wenyin Gong, Chao Lu, Ling Wang
semanticscholar +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 ...
Kacem, Imed +2 more
openaire +3 more sources
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
IEEE Transactions on Cybernetics, 2023
With the development of the economy, distributed manufacturing has gradually become the mainstream production mode. This work aims to solve the energy-efficient distributed flexible job shop scheduling problem (EDFJSP) while simultaneously minimizing ...
Rui Li +4 more
semanticscholar +1 more source
With the development of the economy, distributed manufacturing has gradually become the mainstream production mode. This work aims to solve the energy-efficient distributed flexible job shop scheduling problem (EDFJSP) while simultaneously minimizing ...
Rui Li +4 more
semanticscholar +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
IEEE Transactions on Neural Networks and Learning Systems, 2022
Flexible job shop scheduling problem (FJSP) has attracted research interests as it can significantly improve the energy, cost, and time efficiency of production.
Yu Du +3 more
semanticscholar +1 more source
Flexible job shop scheduling problem (FJSP) has attracted research interests as it can significantly improve the energy, cost, and time efficiency of production.
Yu Du +3 more
semanticscholar +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