Results 301 to 310 of about 193,237 (350)
Some of the next articles are maybe not open access.
Cyclic Schedules for Job Shops with Identical Jobs
Mathematics of Operations Research, 1992We consider the problem of finding cyclic schedules for a job shop in which all jobs are identical. Specifically, we assume that a single product is produced on a finite number of machines. Each part is manufactured by performing a given set of operations in a pre-determined sequence. Each operation can be performed on exactly one machine.
openaire +3 more sources
A multi-action deep reinforcement learning framework for flexible Job-shop scheduling problem
Expert systems with applications, 2022Kun Lei +6 more
semanticscholar +1 more source
A Hybrid Cooperative Coevolution Algorithm for Fuzzy Flexible Job Shop Scheduling
IEEE transactions on fuzzy systems, 2019Flexible scheduling is one of the most significant core techniques for intelligent manufacturing systems. Realization of an optimized schedule through flexible resources assignment is critical to the application and popularization of flexible scheduling,
Lu Sun, Lin Lin, M. Gen, Haojie Li
semanticscholar +1 more source
2016
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
This chapter studies a simple variant of the scheduling problem, namely job shop scheduling with unit-length tasks.
openaire +2 more sources
Improved gray wolf optimizer for distributed flexible job shop scheduling problem
Science China Technological Sciences, 2022Xinyu Li +4 more
semanticscholar +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.
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.
openaire +2 more sources
A Review on Intelligent Scheduling and Optimization for Flexible Job Shop
International Journal of Control, Automation and Systems, 2023Bin Jiang +5 more
semanticscholar +1 more source
A survey of job shop scheduling problem: The types and models
Computers & Operations Research, 2022Hegen Xiong +3 more
semanticscholar +1 more source
A Rollout Metaheuristic for Job Shop Scheduling Problems
Annals of Operations Research, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Meloni, C., Pacciarelli, D., Pranzo, M.
openaire +5 more sources
Dynamic scheduling for flexible job shop using a deep reinforcement learning approach
Computers & industrial engineering, 2023Yong Gui +4 more
semanticscholar +1 more source