Results 11 to 20 of about 62,078 (294)

The flexible job shop scheduling problem: A review

open access: yesEuropean Journal of Operational Research
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dauzère-Pérès, Stéphane   +3 more
openaire   +6 more sources

Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs [PDF]

open access: yesProduction 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

Adaptive Population NSGA-III with Dual Control Strategy for Flexible Job Shop Scheduling Problem with the Consideration of Energy Consumption and Weight

open access: yesMachines, 2021
The flexible job shop scheduling problem has always been the focus of research in the manufacturing field. However, most of the previous studies focused more on efficiency and ignored energy consumption.
Mingliang Wu   +7 more
doaj   +1 more source

Applying flexible job shop scheduling in patients management to optimize processing time in hospitals. [PDF]

open access: yesInternational Journal of Research in Industrial Engineering, 2021
The continuous growth of the population causes an increased demand for our healthcare services. Insufficient hospitals face challenges to serve the patient within a preferable duration.
N. Sarfaraj, Md. L. Lingkon, N. Zahan
doaj   +1 more source

Whale optimization algorithm with opposition-based learning strategy for solving flexible job shop scheduling problem [PDF]

open access: yesITM Web of Conferences, 2022
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

A Two-Phase Iterative Mathematical Programming-Based Heuristic for a Flexible Job Shop Scheduling Problem with Transportation

open access: yesApplied Sciences, 2023
In a flexible job shop problem with transportation (FJSPT), a typical flexible manufacturing system comprises transporters that pick up and deliver jobs for processing at flexible job shops.
Che Han Lim, Seung Ki Moon
doaj   +1 more source

Optimal Design of Flexible Job Shop Scheduling Under Resource Preemption Based on Deep Reinforcement Learning

open access: yesComplex System Modeling and Simulation, 2022
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

Multiobjective optimization for complex flexible job-shop scheduling problems

open access: yesEuropean Journal of Operational Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tamssaouet, Karim   +4 more
openaire   +3 more sources

Dynamic flexible job shop scheduling method based on improved gene expression programming

open access: yesMeasurement + Control, 2021
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

A vibrant crossbreed social spider optimization with genetic algorithm tactic for flexible job shop scheduling problem

open access: yesMeasurement + Control, 2020
Job shop scheduling is one of the major issues in which the scheduling process is associated with the real-time manufacturing industry. A flexible job shop scheduling problem is one of the most important issues among the hardest combinatorial advancement
S Kavitha, P Venkumar
doaj   +1 more source

Home - About - Disclaimer - Privacy