Module org.maxicp

Class SMIC

java.lang.Object
org.maxicp.cp.examples.modeling.SMIC

public class SMIC extends Object
A Single Machine with Inventory Constraints (SMIC) problem consists of scheduling a set of J of n jobs split into in two: - the loading jobs J+ and - the unloading jobs J-. Each job has a release date, a processing time and an inventory modification delta with delta > 0 for loading job and delta invalid input: '<' 0 for unloading job. An initial inventory and the capacity of the inventory storage are given. The aim is to sequence the jobs such that the makespan is minimized while the inventory is range between 0 and the capacity of the inventory.
  • Field Details

    • optimalSolution

      public int optimalSolution
    • solution

      public int[] solution
    • elapsedTime

      public double elapsedTime
    • status

      public boolean status
    • failures

      public int failures
  • Constructor Details

  • Method Details