Results 301 to 310 of about 199,857 (394)
Flexible Job Shop Scheduling Optimization Using Genetic Algorithm For Handling Dynamic Factors
Masmur Tarigan +3 more
openalex +2 more sources
Dynamic scheduling for flexible job shop based on MachineRank algorithm and reinforcement learning. [PDF]
Ren F, Liu H.
europepmc +1 more source
Production scheduling with multi-robot task allocation in a real industry 4.0 setting. [PDF]
Shakeri Z +4 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Evolutionary Computation, 2023
Green flexible job-shop scheduling problem (FJSP) aims to improve profit and reduce energy consumption for modern manufacturing. Meanwhile, FJSP with type-2 fuzzy processing time is proposed to predict the uncertainty in timing constraint for better ...
Rui Li, Wenyin Gong, Chao Lu, Ling Wang
semanticscholar +1 more source
Green flexible job-shop scheduling problem (FJSP) aims to improve profit and reduce energy consumption for modern manufacturing. Meanwhile, FJSP with type-2 fuzzy processing time is proposed to predict the uncertainty in timing constraint for better ...
Rui Li, Wenyin Gong, Chao Lu, Ling Wang
semanticscholar +1 more source
IEEE Transactions on Industrial Informatics, 2023
The job-shop scheduling problem (JSSP) is a classical NP-hard combinatorial optimization problem, and the operating efficiency of manufacturing system is affected directly by the quality of its scheduling scheme.
R. Chen, Wenxin Li, Hongbin Yang
semanticscholar +1 more source
The job-shop scheduling problem (JSSP) is a classical NP-hard combinatorial optimization problem, and the operating efficiency of manufacturing system is affected directly by the quality of its scheduling scheme.
R. Chen, Wenxin Li, Hongbin Yang
semanticscholar +1 more source
Dynamic Job-Shop Scheduling Problems Using Graph Neural Network and Deep Reinforcement Learning
IEEE Transactions on Systems, Man, and Cybernetics: Systems, 2023The job-shop scheduling problem (JSSP) is one of the best-known combinatorial optimization problems and is also an essential task in various sectors.
Chien-Liang Liu, Tzu-Hsuan Huang
semanticscholar +1 more source
IEEE Transactions on Industrial Informatics, 2022
The job-shop scheduling problem (JSP) is NP hard, which has very important practical significance. Because of many uncontrollable factors, such as machine delay or human factors, it is difficult to use a single real-number to express the processing and ...
Gai-ge Wang, D. Gao, W. Pedrycz
semanticscholar +1 more source
The job-shop scheduling problem (JSP) is NP hard, which has very important practical significance. Because of many uncontrollable factors, such as machine delay or human factors, it is difficult to use a single real-number to express the processing and ...
Gai-ge Wang, D. Gao, W. Pedrycz
semanticscholar +1 more source

