Results 251 to 260 of about 2,312,652 (293)
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 0002, Hongze Qiu
openaire +1 more source
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
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
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
A heuristic to schedule flexible job-shop in a glass factory
European Journal of Operational Research, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ramón Alvarez-Valdés +4 more
openaire +3 more sources
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
Transfer-robot task scheduling in flexible job shop
Journal of Intelligent Manufacturing, 2020This paper studies a simultaneous scheduling of production and material transfer in a flexible job shop environment. The simultaneous scheduling approach has been recently adopted by a robotic mobile fulfillment system, wherein transbots pick up jobs and deliver to pick-stations for processing, which requires a simultaneous scheduling of jobs ...
openaire +2 more sources
Adaptive representation for flexible job-shop scheduling and rescheduling
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation, 2009The flexible job-shop scheduling problem (FJSP) is one of the most popular scheduling problems, due to its relative simplicity, compared to real-world scheduling problems, and its NP-hardness. There are two types of decisions involved in solving FJSP problems: (1) assigning machines to operations, or routing, and (2) assigning a time slot in the ...
Prakarn Unachak, Erik D. Goodman
openaire +2 more sources
Assignment and Scheduling in Flexible Job-Shops by Hierarchical Optimization
IEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2007In this paper, we propose a new hierarchical method for the flexible job-shop scheduling problem (FJSP). This approach is mainly adapted to a job-shop problem (JSP) with high flexibility and is based on the decomposition of the problem in an assignment subproblem and a sequencing subproblem.
Nozha Zribi +3 more
openaire +3 more sources
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.
Yuan Yuan 0004, Hua Xu 0003
openaire +2 more sources