Results 21 to 30 of about 2,937 (259)
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu +5 more
doaj +1 more source
Dynamic flexible job shop scheduling method based on improved gene expression programming
Dynamic scheduling is one of the most important key technologies in production and flexible job shop is widespread. Therefore, this paper considers a dynamic flexible job shop scheduling problem considering setup time and random job arrival.
Chunjiang Zhang +5 more
doaj +1 more source
Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs [PDF]
A common assumption in the shop scheduling literature is that the processing order of the operations of each job is sequential; however, in practice, there can be multiple connections and finish‐to‐start dependencies among the operations of each job. This paper studies flexible job shop scheduling problems with arbitrary precedence graphs.
Kasapidis, G. A. +3 more
openaire +2 more sources
Review on flexible job shop scheduling
Flexible job shop scheduling problem (FJSP) is an NP‐hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem. In this study, the existing solution methods for the FJSP in recent literature are classified into exact ...
Jin Xie +4 more
openaire +1 more source
With the development of intelligent manufacturing and the customized product demand of customers, manufacturing enterprises are urgently required to carry out high-efficiency, high-quality, flexibility and low-cost manufacturing to enhance the ...
Yanwei Sang, Jianping Tan, Wen Liu
doaj +1 more source
With the popularization of multi-variety and small-batch production patterns, the flexible job shop scheduling problem (FJSSP) has been widely studied. The sharing of processing resources by multiple machines frequently occurs due to space constraints in
Zhen Chen +3 more
doaj +1 more source
En el presente artículo se aborda el problema Flexible Job Shop Scheduling (FJSSP) con restricciones de transporte, con el objetivo de minimizar el makespan realizando la secuenciación y asignación de máquinas. Se llevó a cabo una revisión bibliográfica
Tatiana Andrea Castillo Jaimes +4 more
doaj +1 more source
Research on Flexible Job Shop Scheduling Problem
Abstract The adjustment time and processing time of the job on the machine are studied as an independent factor considering the influence of the adjustment time, such as installation and positioning, on the efficiency of production scheduling.
Xiangnan Li, Xu Liang
openaire +1 more source
An effective hybrid algorithm for multi-objective flexible job-shop scheduling problem
Genetic algorithm is one of primary algorithms extensively used to address the multi-objective flexible job-shop scheduling problem. However, genetic algorithm converges at a relatively slow speed.
Xiabao Huang, Zailin Guan, Lixi Yang
doaj +1 more source
Whale optimization algorithm with opposition-based learning strategy for solving flexible job shop scheduling problem [PDF]
Flexible job shop scheduling problem is the allocation of available shared resources and the sequencing of processing tasks within a certain period of time to meet certain or certain specific production indicators.
Wu Mingliang, Yang Dongsheng, Liu Tianyi
doaj +1 more source

