Results 231 to 240 of about 82,206 (311)
Some of the next articles are maybe not open access.
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
IEEE Transactions on Automation Science and Engineering, 2022
In modern discrete flexible manufacturing systems, dynamic disturbances frequently occur in real time and each job may contain several special operations in partial-no-wait constraint due to technological requirements.
Shu Luo, Linxuan Zhang, Yushun Fan
semanticscholar +1 more source
In modern discrete flexible manufacturing systems, dynamic disturbances frequently occur in real time and each job may contain several special operations in partial-no-wait constraint due to technological requirements.
Shu Luo, Linxuan Zhang, Yushun Fan
semanticscholar +1 more source
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
Scheduling job shops with uncertainties [PDF]
Effective management of production uncertainties is becoming critical in the era of "time-based competition". The consideration of uncertainties, however, is difficult because of the combinatorial nature of the problem as well as the probabilistic nature of uncertain factors.
Feng Liu, Dong Chen, Peter B. Luh
openaire +1 more source
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
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
Annals of Operations Research, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +6 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +6 more sources
Scheduling job shops with delays
Proceedings. 1987 IEEE International Conference on Robotics and Automation, 1991In this paper, the presence of delay in a job shop is addressed. We show that delay is an important consideration in many manufacturing systems that are modeled as continuous flow processes. A scheduling policy for a job shop with delays is then derived using theoretical arguments and heuristics.
Stanley B. Gershwin+2 more
openaire +3 more sources