Results 221 to 230 of about 82,206 (311)
Multi-objective optimization using improved NSGA-II for integrated process planning and scheduling problems in a machining job shop for large-size valve. [PDF]
Wang J, Xu L, Sun S, Ma Y, Yu G.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Deep reinforcement learning for dynamic scheduling of a flexible job shop
International Journal of Production Research, 2022The ability to handle unpredictable dynamic events is becoming more important in pursuing agile and flexible production scheduling. At the same time, the cyber-physical convergence in production system creates massive amounts of industrial data that ...
Renke Liu, Rajesh Piplani
exaly +2 more sources
Review on flexible job shop scheduling
IET Collaborative Intelligent Manufacturing, 2019Flexible job shop scheduling problem (FJSP) is an NP-hard combinatorial optimisation problem, which has significant applications in the real world. Due to its complexity and significance, lots of attentions have been paid to tackle this problem.
Liang Gao, Xin-Yu Li
exaly +2 more sources
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
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
IEEE Transactions on Neural Networks and Learning Systems, 2022
Flexible job shop scheduling problem (FJSP) has attracted research interests as it can significantly improve the energy, cost, and time efficiency of production.
Yu Du+3 more
semanticscholar +1 more source
Flexible job shop scheduling problem (FJSP) has attracted research interests as it can significantly improve the energy, cost, and time efficiency of production.
Yu Du+3 more
semanticscholar +1 more source
Learning-Based Grey Wolf Optimizer for Stochastic Flexible Job Shop Scheduling
IEEE Transactions on Automation Science and Engineering, 2022This work considers a stochastic flexible job shop scheduling with limited extra resources and machine-dependent setup time in a semiconductor manufacturing environment, which is an NP-hard problem.
Chengran Lin, Zhengcai Cao, Mengchu Zhou
semanticscholar +1 more source
International Journal of Production Research, 2021
Dynamic flexible job-shop scheduling is traditionally a challenge in real-world manufacturing systems, especially considering the constraints of transportation resources and transportation time.
Weibo Ren, Yan Yan, Yaoguang Hu, Yu Guan
semanticscholar +1 more source
Dynamic flexible job-shop scheduling is traditionally a challenge in real-world manufacturing systems, especially considering the constraints of transportation resources and transportation time.
Weibo Ren, Yan Yan, Yaoguang Hu, Yu Guan
semanticscholar +1 more source
In this chapter we are going to consider scheduling tasks on dedicated processors or machines. We assume that tasks belong to a set of jobs, each of which is characterized by its own machine sequence. We will assume that any two consecutive tasks of the same job are to be processed on different machines. The type of factory layout is the job shop.
Jan Węglarz+4 more
openaire +1 more source
Job Shop Scheduling With Deadlines
Journal of Combinatorial Optimization, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E.+3 more
openaire +4 more sources