Results 31 to 40 of about 67,803 (347)
Review on flexible job shop scheduling
IET Collaborative Intelligent Manufacturing, 2019 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
Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs [PDF]
Production and Operations Management, 2021 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
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
Algorithms, 2015 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
IEEE Access, 2020 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
Research on Flexible Job Shop Scheduling Problem
Journal of Physics: Conference Series, 2020 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
Benchmarking flexible job-shop scheduling and control systems [PDF]
, 2013 Benchmarking is comparing the output of different systems for a given set of input data in order to improve the system’s performance. Faced with the lack of realistic and operational benchmarks that can be used for testing optimization methods and ...
Barbosa, José +7 more
core +1 more source
A FJSSP Method Based on Dynamic Multi-Objective Squirrel Search Algorithm
International Journal of Antennas and Propagation, 2021 This paper comprehensively analyzes the characteristics of flexible job shop scheduling problem (FJSSP), takes the dynamic factors in the actual scheduling process such as the arrival and departure of jobs, the breakdown and recovery of machines into ...
Yanjiao Wang, Jieru Han
doaj +1 more source
Sensibility study in a flexible job shop scheduling problem [PDF]
, 2013 This paper proposes the impact assessment of the jobs order in the optimal time of operations in a Flexible Job Shop Scheduling Problem. In this work a real assembly cell was studied: the AIP-PRIMECA cell at the Université de Valenciennes et du Hainaut-
Barbosa, José +3 more
core +3 more sources
Multiobjective optimization for complex flexible job-shop scheduling problems
European Journal of Operational Research, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tamssaouet, Karim +4 more
openaire +3 more sources
An effective hybrid algorithm for multi-objective flexible job-shop scheduling problem
Advances in Mechanical Engineering, 2018 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