jobShop-scheduling-simulatedAnniealing

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.

polito-projects-TeamPicks

Development of a web application based on Flask whose intention is to facilitate the owners of local pubs in satisfying the need of local sports fans to watch a specific sports game on live TV streaming.

TA-FractureLab-ArchiveCatalog

This repo encapsulate a simple python procedure used for handling repetitive tasks during my Part-time Teaching Collaboration at Politecnico di Torino, winter 2020. I performed an indexing task of all gathered literature' paper material by Prof. A. Carpinteri during his carrer and now made available to students of Civil Engineering currently working on material fracture mechanics. The procedure allows compatibility of an Excel data-sheet, where data were manually stored, with the requested and all-precisely-formatted-as-requested Word document. In turn, this shall work as the index catalog of contents of the Laboratory of Fracture library here at Politecnico.