The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machines, such that the maximal completion time (makespan) of all operations is minimi…
☆19Nov 27, 2015Updated 10 years ago
Alternatives and similar repositories for fjssp
Users that are interested in fjssp are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆21Jun 9, 2021Updated 5 years ago
- 异形排列api☆11Sep 14, 2017Updated 8 years ago
- Octave/Matlab Implementation for Job Shop Scheduling Problem☆39Jul 30, 2014Updated 11 years ago
- Deep reinforcement learning for dynamic flexible job-shop scheduling problem☆11Apr 16, 2023Updated 3 years ago
- Learning in Noisy MDP (which is governed by stochastic, exogenous input processes) with input-dependent baseline☆11Aug 7, 2020Updated 5 years ago
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- Operations Research Application Project - Flow Shop Scheduling Based On Reinforcement Learning Algorithm☆105Aug 26, 2018Updated 7 years ago