java.lang.Object
org.maxicp.cp.examples.modeling.FlexibleJobShop
The Flexible Job Shop Problem (FJSP) is an extension of the classical Job
Shop Scheduling Problem.
It consists of a set of jobs, each comprising a sequence of operations that
must be executed in a given order.
Unlike the classical job shop where each operation is assigned to a specific
machine, in the FJSP, each operation
can be processed on any machine from a given set of available machines, with
potentially different processing times.
The goal is to assign each operation to a machine and schedule their start
times such that the maximum completion time (makespan) is minimized.
- Author:
- Pierre Schaus
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
FlexibleJobShop
public FlexibleJobShop()
-
-
Method Details
-
main
-