Package org.drools.planner.examples.pas.domain

Examples of org.drools.planner.examples.pas.domain.BedDesignation

180
181
182
183
184
185
186
187
188
189
190
        }

        public BedDesignation next() {
            lastNextWasLeft = nextIsLeft();
            // Buffer the nextLeft or nextRight
            BedDesignation lowest;
            if (lastNextWasLeft) {
                lowest = nextLeft;
                if (leftIterator.hasNext()) {
                    nextLeft = leftIterator.next();
                } else {
View Full Code Here
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
    private List<BedDesignation> createBedDesignationList(PatientAdmissionSchedule patientAdmissionSchedule) {
        List<BedDesignationInitializationWeight> initializationWeightList
                = new ArrayList<BedDesignationInitializationWeight>(
                patientAdmissionSchedule.getAdmissionPartList().size());
        for (AdmissionPart admissionPart : patientAdmissionSchedule.getAdmissionPartList()) {
            BedDesignation bedDesignation = new BedDesignation();
            bedDesignation.setId(admissionPart.getId());
            bedDesignation.setAdmissionPart(admissionPart);
            int disallowedCount = 0;
            for (Room room : patientAdmissionSchedule.getRoomList()) {
                disallowedCount += (room.getCapacity() * room.countDisallowedAdmissionPart(admissionPart));
            }
            initializationWeightList.add(new BedDesignationInitializationWeight(bedDesignation,
                    bedDesignation.getAdmissionPart().getNightCount(), disallowedCount));
        }
        Collections.sort(initializationWeightList);
        List<BedDesignation> bedDesignationList = new ArrayList<BedDesignation>(
                patientAdmissionSchedule.getAdmissionPartList().size());
        for (BedDesignationInitializationWeight bedDesignationInitializationWeight : initializationWeightList) {
View Full Code Here
25
26
27
28
29
30
31
32
33
34
35
36
37
public class BedDesignationDifficultyWeightFactory implements PlanningEntityDifficultyWeightFactory {

    public Comparable createDifficultyWeight(Solution solution, Object planningEntity) {
        PatientAdmissionSchedule schedule = (PatientAdmissionSchedule) solution;
        BedDesignation bedDesignation = (BedDesignation) planningEntity;
        int disallowedCount = 0;
        for (Room room : schedule.getRoomList()) {
            disallowedCount += (room.countDisallowedAdmissionPart(bedDesignation.getAdmissionPart())
                    * room.getCapacity());
        }
        return new BedDesignationDifficultyWeight(bedDesignation, disallowedCount);
    }
View Full Code Here
TOP

Related Classes of org.drools.planner.examples.pas.domain.BedDesignation

  • org.apache.commons.lang.builder.CompareToBuilder
  • org.apache.commons.lang.builder.EqualsBuilder
  • org.apache.commons.lang.builder.HashCodeBuilder
  • org.drools.planner.examples.pas.domain.solver.BedDesignationDifficultyWeightFactory
  • org.drools.planner.examples.pas.persistence.PatientAdmissionScheduleSolutionImporter$PatientAdmissionScheduleInputBuilder
  • org.drools.planner.examples.pas.solver.move.factory.BedDesignationPillarPartSwapMoveFactory
  • org.drools.planner.examples.pas.solver.move.factory.BedDesignationPillarPartSwapMoveFactory$LowestFirstNightBedDesignationIterator
  • org.drools.planner.examples.pas.solver.move.factory.BedDesignationPillarPartSwitchMoveFactory
  • org.drools.planner.examples.pas.solver.move.factory.BedDesignationPillarPartSwitchMoveFactory$LowestFirstNightBedDesignationIterator
  • org.drools.planner.examples.pas.solver.move.factory.BedDesignationSwapMoveFactory
    • 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.