Results 241 to 250 of about 2,035,483 (294)
Some of the next articles are maybe not open access.
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.
Gianluca Morganti
exaly +4 more sources
Survey of integrated flexible job shop scheduling problems
Computers and Industrial Engineering, 2022Wenxiang Xu, Zhengchao Liu, Xixing Li
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 +2 more sources
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
Approximation Algorithms for Flexible Job Shop Problems
International Journal of Foundations of Computer Science, 2000The Flexible Job Shop problem is a generalization of the classical job shop scheduling problem in which for every operation there is a group of machines that can process it. The problem is to assign operations to machines and to order the operations on the machines so that the operations can be processed in the smallest amount of time.
Klaus Jansen +2 more
openaire +4 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 +2 more sources
An Evaluation of Flexible Workday Policies in Job Shops*
Decision Sciences, 2002ABSTRACTJob shops have long faced pressures for improvement in a challenging and volatile environment. Today's trends of global competition and shortening of product life cycles suggest that both the challenges and the intensity of market volatility will only increase. Consequently, the study of tactics for maximizing the flexibility and responsiveness
Yang, Kum Khiong +2 more
openaire +3 more sources
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
Parallel Meta2heuristics for the Flexible Job Shop Problem
2010In this paper we consider a double-level metaheuristic optimization algorithm. The algorithm proposed here includes two major modules: the machine selection module which is executed sequentially, and the operation scheduling module executed in parallel. On each level a metaheuristic algorithm is used, so we call this method meta2heuristics.
Wojciech Bozejko +2 more
openaire +2 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