Results 251 to 260 of about 4,188 (302)
Research on low carbon welding scheduling based on production process. [PDF]
Sci RepMeng RH +6 more
europepmc +1 more source
A hybrid multi-level ant colony optimization framework for integrated production scheduling and vehicle routing. [PDF]
Sci RepAshour M +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A genetic algorithm for the Flexible Job-shop Scheduling Problem
Computers and Operations Research, 2008In this paper a genetic algorithm for the flexible job-shop scheduling problem is presented. Given are a set of machines and a set of jobs consisting of operations which have to be sequenced in a fixed order. Each operation can be processed by a subset of the machines and its processing time depends on the assigned machine.
G Morganti
exaly +3 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 0002 +3 more
openaire +1 more source
Flexible job shop scheduling with blockages
Mathematical Methods of Operations Research, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ronny S. Hansmann +2 more
openaire +2 more sources
Flexible job-shop scheduling problem under resource constraints
International Journal of Production Research, 2006 A 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.
Felix T S Chan, T C Wong
exaly +2 more sources
A genetic algorithm for flexible job-shop scheduling
Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C), 2003Genetic algorithms have been applied to the scheduling of job shops-a class of very complicated combinatorial optimization problems. Among these algorithms for job shops, a common assumption is that the routes that jobs visit machines are fixed, this is not true for flexible job shops such as flexible manufacturing systems, where jobs have machine ...
Haoxun Chen +2 more
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 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
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 ...
Imed Kacem, Slim Hammadi, Pierre Borne
openaire +3 more sources