Job Sequencing and Tool Switching Problem

This repository provides an implementation of Laporte, Salazar-Gonzales, Semet (2004) formulation of job sequencing and tool switching problem (SSP) with uniform setup time. This formulation was introduced by Laporte, Salazar-Gonzales, Semet (2004).

Usage and Dependencies

• Codes are written in Julia using JuMP framework.
• Solved with Gurobi optimization solver (under an academic license).
• Julia package 'DataStructures.jl' is used for dictionaries.
• Julia package 'Combinatorics.jl' is used for creating a powerset for subtour elimination constraints.

Related works

This is the second mathematical formulation available for SSP, consider to check also:

• Tang and Denardo (1988)
• Catanzaro, Gouveia, Labbe (2015)
• Da Silva, Chaves, Yanasse (2021)
• Mara, Sutoyo, Norcahyo, Rifai (2021)
• Rifai, Mara, Norcahyo (2022)

License

This software is licensed under the MIT License. See file LICENSE for more information.