×
![]()
schedule
| Type: | Model Group |
| Submitter: | Simon Felix |
| Description: | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. |
Parent Model Group (schedule)
All other model groups below were be compared against this "query" model group.  |
 |
|
Model Group Composite (MGC) image
Composite of the decomposed CCM images for every instance in the query model group.
|
Component Instances (Decomposed)
These are the decomposed CCM images for each instance in the query model group. |
These are component instance images.
|
 |
 |
 |
 |
 |
| Name | fhnw-schedule-pairb400 | fhnw-schedule-paira100 | fhnw-schedule-paira200 | fhnw-schedule-paira400 | fhnw-schedule-pairb200 |
MIC Top 5 Model Groups
These are the 5 MGC images that are most similar to the MGC image for the query model group, according to the ISS metric. |
FIXME - These are model group composite images.
|
 |
 |
 |
 |
 |
| Name | 8div | polygonpack | lectsched | ustun | rmatr | |
|
Rank / ISS
The image-based structural similarity (ISS) metric measures the Euclidean distance between the image-based feature vectors for the query model group and all other model groups. A smaller ISS value indicates greater similarity.
|
1 / 1.860 | 2 / 1.865 | 3 / 1.868 | 4 / 1.907 | 5 / 1.915 |
Model Group Summary
The table below contains summary information for schedule, and for the five most similar model groups to schedule according to the MIC.
| MODEL GROUP | SUBMITTER | DESCRIPTION | ISS | RANK | |
|---|---|---|---|---|---|
| Parent Model Group | schedule | Simon Felix | Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem ("Pair A", "Pair B" and "Slot") - we expect "Pair B" to be the best formulation. | 0.000000 | - |
| MIC Top 5 | 8div | Sascha Kurz | Projective binary 8-divisible linear block codes A linear block code is called 8-divisible if the weights of its codewords are divisible by 8. It is called projective if there are no duplicate columns in the generator matrix. The possible lengths of 8-divisible linear block codes have been classified except for length n=59, where it is undecided whether such a linear code exists. The possible dimensions satisfy \\(10 \\le k \\le 20\\). Model 8div_n59_kXX contains the corresponding feasibility problem. Projective binary 8-divisible linear block codes occur as hole configurations of so-called partial solid spreads in finite geometry. Binary 4-divisible linear block codes have applications in physics. | 1.860075 | 1 |
| polygonpack | Antonio Frangioni | Given a set P of polygons, not necessarily convex, and a rectangle, we want to find the subset S of P with largest possible total area and a position every p in S so that there are no overlaps and they are all included in the rectangle. We allow a small set of rotations (0, 90, 180, 270 degrees) for every polygon. The problem is simplified w.r.t. the real application because the polygons do not have (fully encircled) "holes", which are supposedly filled-in separately, although they can have "bays". Models are saved as .lp. Model LpPackingModel_Dim means that we are trying to pack polygons taken from set ; there are currently 5 different sets, and is 7, 10 or 15. | 1.864727 | 2 | |
| lectsched | Harald Schilly | University lecture scheduling model | 1.868448 | 3 | |
| ustun | Berk Ustun | MIP to create optimized data-driven scoring systems. See: https://github.com/ustunb/miplib2017-slim#miplib2017-slim for a description. | 1.907263 | 4 | |
| rmatr | Dmitry Krushinsky | Model coming from a formulation of the p-Median problem using square cost matrices | 1.914575 | 5 |
