Results 11 to 20 of about 199,857 (394)
Applying flexible job shop scheduling in patients management to optimize processing time in hospitals. [PDF]
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
A case study of variational quantum algorithms for a job shop scheduling problem [PDF]
Combinatorial optimization models a vast range of industrial processes aiming at improving their efficiency. In general, solving this type of problem exactly is computationally intractable.
D. Amaro +4 more
semanticscholar +1 more source
Smart factories have attracted a lot of attention from scholars for intelligent scheduling problems due to the complexity and dynamics of their production processes.
Zhong Yang, Li Bi, Xiaogang Jiao
semanticscholar +1 more source
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
Deep Reinforcement Learning for Dynamic Flexible Job Shop Scheduling with Random Job Arrival
The production process of a smart factory is complex and dynamic. As the core of manufacturing management, the research into the flexible job shop scheduling problem (FJSP) focuses on optimizing scheduling decisions in real time, according to the changes
Jingru Chang +4 more
semanticscholar +1 more source
A precedence constrained flow shop scheduling problem with transportation time, breakdown times, and weighted jobs [PDF]
Job precedence can often be seen in various manufacturing process scenarios. For instance, in the context of flow shop scheduling, certain jobs must be processed before a specific job may be executed.
M. Thangaraj +2 more
doaj +1 more source
Advanced Metaheuristic Method for Decision-Making in a Dynamic Job Shop Scheduling Environment
As a well-known NP-hard problem, the dynamic job shop scheduling problem has significant practical value, so this paper proposes an Improved Heuristic Kalman Algorithm to solve this problem.
Hankun Zhang +3 more
doaj +1 more source
Dynamic flexible job shop scheduling (JSS) is an important combinatorial optimization problem with complex routing and sequencing decisions under dynamic environments.
Fangfang Zhang +4 more
semanticscholar +1 more source
The Comparison of the Integer Programming Models for Solving the Stage Shop Scheduling Problem [PDF]
The development and extending the classic models for approaching the real world conditions are always in consideration of researchers. For this reason, many efforts are made for generalization of the job shop scheduling problem. The stage shop scheduling
Mohammad Mahdi Nasiri
doaj +1 more source
The energy-saving scheduling problem (ESSP) has gained increasing attention of researchers in the manufacturing field. However, there is a lack of studies on ESSPs in the assembly job shop environment.
Tianhua Jiang +3 more
doaj +1 more source

