Results 261 to 270 of about 225,952 (299)
Some of the next articles are maybe not open access.
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
Reactive Flexible Job Shop Problem with Stress Level Consideration
2023Taking into account a real-world issue, the present study focuses on a flexible job shop scheduling problem (FJSSP) that deals with new job arrivals. This problem is very common in real-world manufacturing operations. On the other hand, Industry 5.0 environment pays more attention to human resources, and it is shown that well-being of workers including
Yadegari, Ehsan +2 more
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
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
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 Bożejko +2 more
openaire +1 more source
Adaptive multimeme algorithm for flexible job shop scheduling problem
Natural Computing, 2016In this paper, we propose an adaptive multimeme algorithm (AMMA) to address the flexible job shop scheduling problem (FJSP) with the objective to minimize the makespan. The search operator is modeled as a synergy of genetic and memetic mechanisms through integrating a stochastic variation and a local search procedure into a composite operator for each ...
Zuo, Yi, Gong, Maoguo, Jiao, Licheng
openaire +1 more source
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
Solving the Flexible Job Shop Problem on GPU
2012In this work we examine a model of flexible job shop problem in which for a given operation there is a possibility of a choice of the machine on which this operation will be carried out. This problem is a generalization of the classic job shop problem. We present a tabu search algorithm in which "a golf neighborhood" was applied.
Wojciech Bożejko +2 more
openaire +1 more source
Effective neighbourhood functions for the flexible job shop problem
Journal of Scheduling, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mastrolilli, Monaldo +1 more
openaire +2 more sources
Bottleneck Identification of Extended Flexible Job Shop Scheduling Problem
2018 6th International Symposium on Computational and Business Intelligence (ISCBI), 2018In the Extended Flexible Job Shop Scheduling Problem (EFJSP), the temporal constraints among the tasks could be very complex including serial, parallel and flexible relations. This paper presents a method for identifying the critical tasks that affect the makespan most remarkably, which we call the "bottleneck tasks". To this end, we first transfer the
Yunfei Wang +5 more
openaire +1 more source