1

I am trying to develop a choco solver to the probelm of the Planning of telephone support center. in 12 hours from 8:00 o clock to 20:00.

variables and constraint :

  • Number of employees = 9
  • Minimum ans Maximum buisiness hours for every employee (h and H)
  • buisiness hours foe all employees : 42 hours <= total hours <= 42+C (C in my case equals 2)
  • Table of numbers of employee who work in every hour ( size of table =12 )

Contrainst who i cant'make :

I got to know the number of nuisiness hours for each employee but I can not put them in tracking hours :/

the result will be :

Final Result

but until now i got my result untill now

I think it's sort problem... please if you can just save my life and tell me what is the missing constraint in my code.

My code

  package projetppc;

import java.util.Arrays;
import javax.swing.SortingFocusTraversalPolicy;
import org.chocosolver.solver.Model;
import org.chocosolver.solver.Solution;
import org.chocosolver.solver.variables.IntVar;

public class ProjetPPC {

    public void modelAndSolve() {

        int k = 9;
        int htpj = 12;
        int h = 4;
        int H = 6;
        int C = 2;
        int HT = 42;

        Model model = new Model(k + "- CAT");

        int[] numOfemp = {1, 2, 4, 5, 5, 4, 5, 5, 3, 4, 2, 2};

        IntVar[][] matrix = new IntVar[k][htpj];

        for (int i = 0; i < k; i++) {
            for (int j = 0; j < htpj; j++) {
                matrix[i][j] = model.intVar("(" + i + "," + j + ")", 0, 1);

            }

        }


        model.arithm(matrix[0][0], "=", 1).post();

        int[] coeffs1 = new int[htpj];
        Arrays.fill(coeffs1, 1);

        // constraint 1 et 2
        for (int i = 0; i < k; i++) {
            model.scalar(matrix[i], coeffs1, "<=", H).post();
            model.scalar(matrix[i], coeffs1, ">=", h).post();
        }
        int[] coeffs2 = new int[k];
        Arrays.fill(coeffs2, 1);


        IntVar[][] inversematrix = new IntVar[htpj][k];
        for (int i = 0; i < k; i++) {
            for (int j = 0; j < htpj; j++) {
                inversematrix[j][i] = matrix[i][j];
            }

        }
        // constraint
        for (int i = 0; i < htpj; i++) {
            model.scalar(inversematrix[i], coeffs2, "=", numOfemp[i]).post();

        }

        // constraint
        IntVar[] alltable = new IntVar[k * htpj];

        for (int i = 0; i < k; i++) {
            for (int j = 0; j < htpj; j++) {
                alltable[(htpj * i) + j] = matrix[i][j];
            }
        }

        int[] coeffs3 = new int[k * htpj];
        Arrays.fill(coeffs3, 1);
        model.scalar(alltable, coeffs3, ">=", HT).post();
        model.scalar(alltable, coeffs3, "<=", HT + C).post();




        // solution
        Solution solution = model.getSolver().findSolution();
        if (solution != null) {
            for (int i = 0; i < k; i++) {

                System.out.println("employé " + i + " " + Arrays.toString(matrix[i]));

            }


        } else {

            System.out.println("Pas de solution.");
        }
    }

     public static void main(String[] args) {
        new ProjetPPC().modelAndSolve();
    }
}
TheLastOne
  • 61
  • 5

0 Answers0