Job-shop Scheduling Problem using Policy Gradients.

This code learns Priority Dispatching Rules (PDRs) on the Job-shop Scheduling Problem (JSP) using sequence learning and Policy Gradients.

Requirements:

Execute -> pytorch.ipynb

Name		Name	Last commit message	Last commit date
Latest commit History 10 Commits
datasets		datasets
datasets_multiobjective		datasets_multiobjective
.gitignore		.gitignore
LICENSE		LICENSE
README.md		README.md
config.ipynb		config.ipynb
create_dataset.ipynb		create_dataset.ipynb
environment.ipynb		environment.ipynb
heuristic_FCFS.ipynb		heuristic_FCFS.ipynb
heuristic_LPT.ipynb		heuristic_LPT.ipynb
heuristic_LWR.ipynb		heuristic_LWR.ipynb
heuristic_SPT.ipynb		heuristic_SPT.ipynb
metaheuristic.ipynb		metaheuristic.ipynb
metaheuristic_multiobjetive.ipynb		metaheuristic_multiobjetive.ipynb
placement_ortools.ipynb		placement_ortools.ipynb
placement_ortools_multiobjective.ipynb		placement_ortools_multiobjective.ipynb
pytorch.ipynb		pytorch.ipynb
pytorch_multiobjective.ipynb		pytorch_multiobjective.ipynb

Provide feedback