Package org.drools.planner.examples.nurserostering.domain

Examples of org.drools.planner.examples.nurserostering.domain.Assignment

53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
        WorkingMemory workingMemory = localSearchSolverScope.getWorkingMemory();

        Score firstScore = localSearchSolverScope.calculateScoreFromWorkingMemory();
        // do AssignmentSwitchMove
        Employee leftEmployee = findEmployeeById(nurseRoster, 0L);
        Assignment leftAssignment = findAssignmentById(nurseRoster, 200204001L);
        assertEquals(leftEmployee, leftAssignment.getEmployee());
        Employee rightEmployee = findEmployeeById(nurseRoster, 12L);
        Assignment rightAssignment = findAssignmentById(nurseRoster, 200204002L);
        assertEquals(rightEmployee, rightAssignment.getEmployee());
        NurseRosteringMoveHelper.moveEmployee(workingMemory, leftAssignment, rightEmployee);
        NurseRosteringMoveHelper.moveEmployee(workingMemory, rightAssignment, leftEmployee);
        localSearchSolverScope.calculateScoreFromWorkingMemory();
        // undo AssignmentSwitchMove;
        NurseRosteringMoveHelper.moveEmployee(workingMemory, rightAssignment, rightEmployee);
View Full Code Here
97
98
99
100
101
102
103
104
105
106
107
108
109
                shiftDateList.size() * nurseRoster.getEmployeeList().size());
        int assignmentId = 0;
        for (ShiftInitializationWeight shiftInitializationWeight : shiftInitializationWeightList) {
            Shift shift = shiftInitializationWeight.getShift();
            for (int i = 0; i < shift.getRequiredEmployeeSize(); i++) {
                Assignment assignment = new Assignment();
                assignment.setId((long) assignmentId);
                assignment.setShift(shift);
                assignmentList.add(assignment);
                assignmentId++;
            }
        }
        return assignmentList;
View Full Code Here
32
33
34
35
36
37
38
39
40
41
42
43
44
    public List<Move> createCachedMoveList(Solution solution) {
        NurseRoster nurseRoster = (NurseRoster) solution;
        List<Assignment> assignmentList = nurseRoster.getAssignmentList();
        List<Move> moveList = new ArrayList<Move>();
        for (ListIterator<Assignment> leftIt = assignmentList.listIterator(); leftIt.hasNext();) {
            Assignment leftAssignment = leftIt.next();
            for (ListIterator<Assignment> rightIt = assignmentList.listIterator(leftIt.nextIndex()); rightIt.hasNext();) {
                Assignment rightAssignment = rightIt.next();
                moveList.add(new AssignmentSwitchMove(leftAssignment, rightAssignment));
            }
        }
        return moveList;
    }
View Full Code Here
TOP

Related Classes of org.drools.planner.examples.nurserostering.domain.Assignment

  • org.apache.commons.lang.builder.CompareToBuilder
  • org.apache.commons.lang.builder.EqualsBuilder
  • org.apache.commons.lang.builder.HashCodeBuilder
  • org.drools.planner.examples.nurserostering.solver.move.factory.AssignmentSwitchMoveFactory
  • org.drools.planner.examples.nurserostering.solver.NurseRosteringScoreRulesTest
  • org.drools.planner.examples.nurserostering.solver.solution.initializer.NurseRosteringStartingSolutionInitializer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.