Results 211 to 220 of about 2,311,919 (246)
Some of the next articles are maybe not open access.
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
Scheduling jobs and maintenances in flexible job shop with a hybrid genetic algorithm
Journal of Intelligent Manufacturing, 2006Most flexible job shop scheduling models assume that the machines are available all of the time. However, in most realistic situations, machines may be unavailable due to maintenances, pre-schedules and so on. In this paper, we study the flexible job shop scheduling problem with availability constraints.
Jie Gao 0007, Mitsuo Gen, Linyan Sun
openaire +1 more source
Heuristic approaches for scheduling jobs in large-scale flexible job shops
Computers & Operations Research, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oleh Sobeyko, Lars Mönch
openaire +3 more sources
Routing and scheduling in a flexible job shop by tabu search
Annals of Operations Research, 1993A hierarchical algorithm for the flexible job shop scheduling problem is described, based on the tabu search metaheuristic. Hierarchical strategies have been proposed in the literature for complex scheduling problems, and the tabu search metaheuristic, being able to cope with different memory levels, provides a natural background for the development of
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
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 +2 more sources
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
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 with Changeover Priorities
2022Holden Milne +4 more
openaire +2 more sources