Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:05, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Study of a NP-hard cyclic scheduling problem: The recurrent job-shop |
scientific article |
Statements
Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (English)
0 references
12 April 1994
0 references
pipelined architectures
0 references
cyclic scheduling
0 references
disjunctive resources
0 references
recurrent job-shop
0 references
NP-hard
0 references
mixed linear program
0 references
branch-and-bound
0 references
heuristics
0 references
