Results 21 to 30 of about 246,867 (304)
Multi-Criteria Optimization in Operations Scheduling Applying Selected Priority Rules
The utilization of a specific priority rule in scheduling operations in flexible job shop systems strongly influences production goals. In a context of production control in real practice, production performance indicators are evaluated always en bloc ...
Zuzana Červeňanská +3 more
doaj +1 more source
A MILP model for an extended version of the Flexible Job Shop Problem [PDF]
A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order.
Birgin, Ernesto G. +5 more
core +2 more sources
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
Flexible Job Shop Problem with Variable Machine Flexibility
Abstract We analyze machine flexibility in the context of the flexible job shop problem. In general, the decisions about machine flexibility are taken in advance (the data sets already contain this information). Based on a mathematical model from literature, we proposed an extension that, aiming to minimize the makespan, considers the possibility of ...
Silvio Alexandre de Araujo +1 more
openaire +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
Benchmarking flexible job-shop scheduling and control systems [PDF]
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
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
Sensibility study in a flexible job shop scheduling problem [PDF]
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 +4 more sources

