An extended version of the flexible job shop problem is tackled in this work. The considered extension to the classical flexible job shop problem allows the precedences between the operations to be given by an arbitrary directed acyclic graph instead of a linear order. Therefore, the problem consists of allocating the operations to the machines and sequencing them in compliance with the given p...

Flexible job shops are characterized by the existence of alternative –not necessarily identicalmachines, which permits parts to have different alternative routes in the shop. In a dynamic scheduling situation in which jobs continuously arrive over time, part routing rules are needed to deal with such routing flexibility as much as sequencing rules which define the order by which parts are admit...

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

Flexible production is a typical representative of high-end manufacturing and also manifestation country’s national capability. Compared with other modes, the key distinction flexible that all four dimensions (i.e., machines, operations, products, orders) can be scheduled dynamically. Although many studies have investigated job shop scheduling problem, most limited dynamic support cannot deal m...

The traditional shop floor scheduling problem mainly focuses on the static environment, which is unrealistic in actual production. To solve this problem, paper proposes a digital twin-driven adaptive method. Firstly, twin model of production line established to monitor operation real time and provide real-time data source for subsequent scheduling; secondly, address that solution quality effici...

According to the characteristics of flexible job shop scheduling (FJPS), a mathematical model was established minimize maximum completion time, and an improved genetic algorithm proposed solve problem. A variety heuristic methods are used improve quality initial solution. The parallel double-chain encoding is designed optimal insertion method Two crossover methods, namely IPOX multi-point cross...