A mixed integer programming (MIP) based Jobshop Scheduling Problem (JSP) solving. Based on C++ and Gurobi. This program is used for course project of Production Management at Tsinghua University. Basic disjunctive MIP model is built and tested on JSPLIB dataset.

[1] R. Cheng, M. Gen, and Y. Tsujimura, “A tutorial survey of job-shop scheduling problems using genetic algorithms—i. representation,” Computers and Industrial Engineering, vol. 30, no. 4, pp. 983–997, 1996, ISSN: 0360-8352. DOI: https://doi.org/10.1016/0360- 8352(96) 00047-2. [Online]. Available: https://www.sciencedirect.com/science/article/pii/ 0360835296000472.

[2] W.-Y. Ku and J. C. Beck, “Mixed integer programming models for job shop scheduling: A computational analysis,” Computers and Operations Research, vol. 73, pp. 165–173, 2016, ISSN: 0305-0548. DOI: https://doi.org/10.1016/j.cor.2016.04.006. [Online]. Available: https://www.sciencedirect.com/science/article/pii/S0305054816300764.

[3] A. Manne, “On the job-shop scheduling problem,” Operations Research, vol. 8, no. 2, pp. 219– 223, 1960. [Online]. Available: https://EconPapers.repec.org/RePEc:inm:oropre:v:8:y:1960:i:2:p:219-223.

[4] “Jsplib.” (), [Online]. Available: https://github.com/tamy0612/JSPLIB