Results 301 to 310 of about 1,249,401 (374)
Some of the next articles are maybe not open access.
A Hybrid Iterated Greedy Algorithm for a Crane Transportation Flexible Job Shop Problem
IEEE Transactions on Automation Science and Engineering, 2022In this study, we propose an efficient optimization algorithm that is a hybrid of the iterated greedy and simulated annealing algorithms (hereinafter, referred to as IGSA) to solve the flexible job shop scheduling problem with crane transportation ...
Jun-qing Li +6 more
semanticscholar +1 more source
IEEE Transactions on Cybernetics, 2022
In the actual production, the insertion of new job and machine preventive maintenance (PM) are very common phenomena. Under these situations, a flexible job-shop rescheduling problem (FJRP) with both new job insertion and machine PM is investigated ...
Youjun An +4 more
semanticscholar +1 more source
In the actual production, the insertion of new job and machine preventive maintenance (PM) are very common phenomena. Under these situations, a flexible job-shop rescheduling problem (FJRP) with both new job insertion and machine PM is investigated ...
Youjun An +4 more
semanticscholar +1 more source
International Journal of Production Research, 2022
In a complex and dynamic job shop containing logistics factor, schedule needs to be generated rapidly, so the real-time scheduling method is more suitable for such scenario.
Lei Cai, Wenfeng Li, Yun Luo, Lijun He
semanticscholar +1 more source
In a complex and dynamic job shop containing logistics factor, schedule needs to be generated rapidly, so the real-time scheduling method is more suitable for such scenario.
Lei Cai, Wenfeng Li, Yun Luo, Lijun He
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
, 1996 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
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 +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,
Edwin Hou, Nirwan Ansari
openaire +4 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,
Edwin Hou, Nirwan Ansari
openaire +4 more sources
Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism
IEEE transactions on fuzzy systems, 2020The emergence of fuzzy sets makes job-shop scheduling problem (JSSP) become better aligned with the reality. This article addresses the JSSP with fuzzy execution time and fuzzy completion time (FJSSP).
D. Gao, Gai-ge Wang, W. Pedrycz
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