• Stars
    star
    2
  • Language
    Python
  • License
    MIT License
  • Created over 3 years ago
  • Updated almost 2 years ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

This repo encapsulates a Python implementation of the Simulated Annealing Algorithm to solve by means of a "minimum energy state" heuristic the NP-hard n-machines|no preemption|C_max job shop scheduling problem, considering n=2 machines and jobs having release dates. The code was designed and wrote by me. The whole heuristic design, complexity analysis, optimization, and ideas were made possible by team-working with Arianna Montironi and Chiara Panetta. The developed heuristic is the final deliverable of our project work held during the Quantitative Methods for Decision Aid 2021 Class in Politecnico di Torino.