Search results
In this study, we introduce a novel mathematical model for addressing the dual resource constraint flexible job shop scheduling problem with sequence-dependent setup times (DRCFJS-SDST), a significant challenge within flexible manufacturing systems.
13 lis 2020 · This paper proposed a similarity-based scheduling algorithm for setup-time reduction to solve the dual resource constrained flexible job shop scheduling problem, with the makespan and the loading and unloading time as objectives.
The model of dual-resource multi-objective flexible job shop scheduling problem, which considers dual-resource constraints of machines and workers and uncertain operation time constraint, is established, and it takes delivery satisfaction, cost, energy consumption and noise pollution as the optimized objects based upon the actual situation of ...
16 kwi 2024 · The flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimization problem, which has wide applications in the real world. The complexity and relevance of the FJSP have led to numerous research works on its modeling and resolution.
29 mar 2019 · This paper states a novel dual-resource constrained flexible job-shop problem (DRCFJSP) whose performance considers simultaneously makespan and due date-oriented criteria, where eligibility and processing time are both dependent on worker expertise.
1 lut 2024 · Flexible job shop scheduling problem. Improved memetic algorithm. Discrete operation sequence flexibility.
1 cze 2023 · Firstly, a Markov decision process with composite scheduling action is provided to elaborate the flexible job-shop dynamic scheduling process and transform the DFJSP into an RL task. Subsequently, a composite scheduling action aggregated by SDRs and continuous weight variables is designed to provide a continuous rule space and SDR weight selection.
