Package org.ddolib.examples.pigmentscheduling
package org.ddolib.examples.pigmentscheduling
This package implements the acs, astar and ddo models for the Pigment Sequencing Problem (PSP).
The Pigment Sequencing Problem (PSP) is a single-machine production planning problem
that aims to minimize the stocking and changeover costs while satisfying a set of orders.
There are different item types I = {0,...,𝑛−1}.
For each type, a given stocking cost S_i to pay for each time period
between the production and the deadline of an order.
For each pair i,j in I of item types, a changeover cost C_ij is incurred
whenever the machine switches the production from item type i to j.
Finally, the demand matrix Q contains all the orders: Q_i^p in {0,1}
indicates whether there is an order for item type i in I at time period p.
0 ≤ p < H where H is the time horizon.
-
ClassesClassDescriptionThe Pigment Sequencing Problem (PSP) with Acs.The Pigment Sequencing Problem (PSP) with AsTar.The Pigment Sequencing Problem (PSP) with Ddo.Computes a fast lower bound for the Pigment Sequencing Problem (PSP).Entry point for solving the Pigment Sequencing Problem (PSP) using a Large Neighborhood Search (LNS) approach combined with Decision Diagram Optimization (DDO).Represents an instance of the Pigment Sequencing Problem (PSP) used within a Decision Diagram Optimization (DDO) framework.Provides a ranking heuristic for comparing two
PSStateobjects within the Production Scheduling Problem (PSP) search framework.Implements the relaxation mechanism used in the DDO framework for the Pigment Scheduling Problem (PSP).Represents a state in the Production Scheduling Problem (PSP).