A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach |
scientific article |
Statements
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (English)
0 references
7 March 2022
0 references
bi-objective branch-and-bound
0 references
\( \in \)-constraint
0 references
scheduling
0 references
mixed graph coloring
0 references
multiobjective optimization
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
