Package org.ddolib.examples.smic
package org.ddolib.examples.smic
This package implements the acs, astar and ddo models for the Single Machine with Inventory Constraint (SMIC).
Given a set J of n jobs, partitioned into a set J1
of n1 loading jobs and set J2 of n2 unloading jobs. Each job j ∈ J has a
processing time p ∈ R+, a release date r ∈ R+ and a positive (resp. negative) inventory
modification for loading (resp. unloading) task. The objective is to sequence
the jobs in J such that the makespan is minimized while the inventory is between a given range.
This problem is considered in the paper:
-
ClassDescriptionThe Single Machine with Inventory Constraint (SMIC) with Acs.The Single Machine with Inventory Constraint (SMIC) with AsTar.The Single Machine with Inventory Constraint (SMIC) with Ddo.The
SMICDominanceclass defines the dominance relation between two states of theSMICStatein the context of the Single Machine with Inventory Constraint (SMIC) problem.TheSMICFastLowerBoundclass provides a fast and simple estimation of the lower bound of the remaining cost (or completion time) in the Single Machine with Inventory Constraint (SMIC) scheduling problem.TheSMICGenratorclass is responsible for generating random instances of the Single Machine with Inventory Constraint (SMIC) problem.Entry point for solving the Single Machine with Inventory Constraint (SMIC) problem using a Large Neighborhood Search (LNS) approach.TheSMICProblemclass represents an instance of the Single Machine with Inventory Constraint (SMIC) scheduling problem.TheSMICRankingclass defines a heuristic ranking criterion for comparing twoSMICStateinstances during search or optimization.TheSMICRelaxclass implements a relaxation operator for theSMICProblem, used in Decision Diagram Optimization (DDO)-based solvers.TheSMICStaterecord represents a state in the search space of the Single Machine with Inventory Constraint (SMIC) scheduling problem.