Job-shop with two jobs and irregular criteria
Résumé
We use the Akers-Friedman geometric approach to solve the two jobs job-shop problem when there is an
earliness cost on the first operation and a tardiness cost on the last operation of each job. We then generalize the problem by imposing earliness and tardiness costs on each operation and finally, we solve it using a dynamic programming algorithm.