Package org.ddolib.examples.msct

package org.ddolib.examples.msct
This package implements the acs, astar and ddo models for the Minimum Sum Completion Time (MSCT). The problem is to sequence n jobs such that: - each job is scheduled after its release time - the sum of completion time is minimized This DP model is from : J. Christopher Beck, Ryo Kuroiwa, Jimmy H. M. Lee, Peter J. Stuckey, Allen Z. Zhong: Transition Dominance in Domain-Independent Dynamic Programming. CP 2025: 5:1-5:23 In this model a state is represented by: - the set of remaining jobs - the current time (the end time of last sequenced job)
  • Class
    Description
    MSCTAcsMain
    Minimum Sum Completion Time (MSCT) with Acs.
    MSCTAstarMain
    Minimum Sum Completion Time (MSCT) with AsTar.
    MSCTDdoMain
    Minimum Sum Completion Time (MSCT) with Ddo.
    MSCTDominance
    Implements the dominance relation for the Maximum Sum of Compatible Tasks (MSCT) problem.
    MSCTFastLowerBound
    Provides a fast lower bound computation for the Maximum Sum of Compatible Tasks (MSCT) problem.
    MSCTGenerator
    Contains methods to generates instance of the MSCT
    MSCTLnsMain
    Entry point for solving the Minimum Sum of Completion Times (MSCT) problem using a Large Neighborhood Search (LNS) approach combined with Decision Diagram Optimization (DDO).
    MSCTProblem
    Represents an instance of the **Minimum Sum of Completion Times (MSCT)** problem.
    MSCTRanking
    Provides a ranking strategy for MSCTState objects used in the search process for solving the Maximum Sum of Completion Times (MSCT) problem.
    MSCTRelax
    Implements the relaxation operator for the MSCTProblem in the context of Decision Diagram Optimization (DDO) algorithms.
    MSCTState
    Represents a state in the MSCTProblem (Minimum Sum of Completion Times) scheduling problem.