Results 311 to 320 of about 199,857 (394)
Some of the next articles are maybe not open access.
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
A new neighbourhood structure for job shop scheduling problems
International Journal of Production Research, 2022Job shop scheduling problem (JSP) is a widely studied NP-complete combinatorial optimisation problem. Neighbourhood structures play a critical role in solving JSP. At present, there are three state-of-the-art neighbourhood structures, i.e. N5, N6, and N7.
J. Xie, Xinyu Li, Liang Gao, Lin Gui
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
Review of job shop scheduling research and its new perspectives under Industry 4.0
Journal of Intelligent Manufacturing, 2017Jian Zhang, Guofu Ding, Shengfeng Qin
exaly +2 more sources
1997
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
The job shop scheduling problem (JSP) is a resource allocation problem where the resources are called machines. The problem involves finding an assignment (schedule) for a set of jobs to the machines so that the jobs can be completed “optimally.” Each job may consist of several tasks, and each task must be processed on a particular machine. Furthermore,
Nirwan Ansari, Edwin Hou
openaire +2 more sources
IEEE Transactions on Evolutionary Computation
Job shop scheduling (JSS) is a process of optimizing the use of limited resources to improve the production efficiency. JSS has a wide range of applications, such as order picking in the warehouse and vaccine delivery scheduling under a pandemic. In real-
Fangfang Zhang +3 more
semanticscholar +1 more source
Job shop scheduling (JSS) is a process of optimizing the use of limited resources to improve the production efficiency. JSS has a wide range of applications, such as order picking in the warehouse and vaccine delivery scheduling under a pandemic. In real-
Fangfang Zhang +3 more
semanticscholar +1 more source
IEEE Transactions on Industrial Informatics
As the intelligent manufacturing paradigm evolves, it is urgent to design a near real-time decision-making framework for handling the uncertainty and complexity of production line control.
Kun Lei +5 more
semanticscholar +1 more source
As the intelligent manufacturing paradigm evolves, it is urgent to design a near real-time decision-making framework for handling the uncertainty and complexity of production line control.
Kun Lei +5 more
semanticscholar +1 more source
Scheduling the General Job-Shop
Management Science, 1985A family of algorithms is described for finding optimum schedules for job-shops. The algorithms are of a branch and bound type but have a complete schedule associated with each node of the search tree. Branching from nodes is based on important conflicts in the schedule. Some results are provided.
Jeffrey R. Barker, Graham B. McMahon
openaire +1 more source
1996
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources
Within the great variety of production scheduling problems the general job shop problem (JSP) is the probably most studied one by academic research during the last decade. It has earned a reputation for being notoriously difficult to solve. It illustrates at least some of the demands required by a wide array of real world problems.
SIMON Y. FOO, YOSHIYASU TAKEFUJI
openaire +2 more sources