A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:50, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times |
scientific article |
Statements
A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (English)
0 references
5 August 1996
0 references
sequence dependent setup-times
0 references
disjunctive graph model
0 references
precedence relations
0 references
job-shop problem
0 references
open-shop problem
0 references
