Results 251 to 260 of about 62,078 (294)
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 +3 more
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
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
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
Flexible job-shop scheduling problem under resource constraints
International Journal of Production Research, 2006A flexible job-shop-scheduling problem is an extension of classical job-shop problems that permit an operation of each job to be processed by more than one machine. The research methodology is to assign operations to machines (assignment) and determine the processing order of jobs on machines (sequencing) such that the system objectives can be ...
Wong, TC, Chan, FTS, Chan, LY
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
Immune genetic algorithm for flexible job-shop scheduling problem
2010 IEEE International Conference on Automation and Logistics, 2010An kind of immune genetic algorithm(IGA) is proposed for solving the flexible job-shop scheduling problem(FJSP). Based on the globalsearching method of classic genetic algorithm (SG), and using the diversity preservation strategy of antibodies in biology immunity mechanism, the method greatly improves the colony diversity of GA and compared to genetic ...
null Jia Ma +2 more
openaire +1 more source
Hierarchical Optimization for the Flexible Job Shop Scheduling Problem
IFAC Proceedings Volumes, 2004Abstract In this paper we propose a new approach for the flexible job shop scheduling problem. This approach is based on the decomposition of the problem in an assignrnent problem and a sequencing probleln. The first part is ensured by an assignment technique based successively on a heuristic approach and a local search.
N. Zribi, I. Kacem, A. El Kamel
openaire +1 more source
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