Uses of Class
org.ddolib.examples.pigmentscheduling.PSState
Packages that use PSState
Package
Description
This package implements the acs, astar and ddo models for the Pigment Sequencing Problem (PSP).
-
Uses of PSState in org.ddolib.examples.pigmentscheduling
Methods in org.ddolib.examples.pigmentscheduling that return PSStateModifier and TypeMethodDescriptionprotected PSStatePSState.clone()Creates a deep copy of this state.PSProblem.initialState()Builds the initial problem state, where no items have been produced and the machine is idle.PSRelax.mergeStates(Iterator<PSState> states) Merges multiple PSP states into a single relaxed state.PSProblem.transition(PSState state, Decision decision) Applies a production decision to the current state and returns the resulting new state.Methods in org.ddolib.examples.pigmentscheduling with parameters of type PSStateModifier and TypeMethodDescriptionintCompares two PSP states based on their total remaining demand.Defines the domain of feasible decisions (items to produce or idle) for a given state and time depth.doublePSFastLowerBound.fastLowerBound(PSState state, Set<Integer> variables) Computes a fast (but admissible) lower bound on the remaining production cost for the given PSP state.doubleReturns the relaxed transition cost between two PSP states.PSProblem.transition(PSState state, Decision decision) Applies a production decision to the current state and returns the resulting new state.doublePSProblem.transitionCost(PSState state, Decision decision) Computes the cost incurred by executing a given decision from the current state.Method parameters in org.ddolib.examples.pigmentscheduling with type arguments of type PSStateModifier and TypeMethodDescriptionPSRelax.mergeStates(Iterator<PSState> states) Merges multiple PSP states into a single relaxed state.