Results 321 to 330 of about 199,857 (394)
Some of the next articles are maybe not open access.

Deep reinforcement learning for dynamic scheduling of a flexible job shop

International Journal of Production Research, 2022
The 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, R. Piplani, C. Toro
semanticscholar   +1 more source

Job Shop Scheduling With Deadlines

Journal of Combinatorial Optimization, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
BALAS E.   +3 more
openaire   +3 more sources

Constraint-Based Job Shop Scheduling with IILOG SCHEDULER

Journal of Heuristics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nuijten, W.P.M., Le Pape, C.
openaire   +2 more sources

Fuzzy job shop scheduling

International Journal of Production Economics, 1996
Abstract This paper discusses job shop scheduling from the viewpoint of dealing with fuzziness inherent in the problem. Some static problems with fuzzy information regarding due dates and/or operation times are solved using a branch-and-bound algorithm and the meaning of solving such scheduling problems is described.
Mitsuru Kuroda, Zeng Wang
openaire   +1 more source

A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems

IEEE/CAA Journal of Automatica Sinica, 2019
Flexible job shop scheduling problems ( FJSP ) have received much attention from academia and industry for many years. Due to their exponential complexity, swarm intelligence ( SI ) and evolutionary algorithms ( EA ) are developed, employed and improved ...
K. Gao   +5 more
semanticscholar   +1 more source

Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism

IEEE transactions on fuzzy systems, 2020
The 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

Job Shop Scheduling

1992
The job shop scheduling problem is described as follows. Given are a set of jobs and a set of machines. Each machine can handle at most one job at a time. Each job consists of a chain of operations, each of which needs to be processed during an uninterrupted time period of a given length on a given machine.
openaire   +1 more source

Knowledge-Based Reinforcement Learning and Estimation of Distribution Algorithm for Flexible Job Shop Scheduling Problem

IEEE Transactions on Emerging Topics in Computational Intelligence, 2023
Yu Du   +4 more
semanticscholar   +1 more source

Review on flexible job shop scheduling

IET Collaborative Intelligent Manufacturing, 2019
Flexible 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.
J. Xie   +4 more
semanticscholar   +1 more source

Home - About - Disclaimer - Privacy