Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Study of a NP-hard cyclic scheduling problem: The recurrent job-shop |
scientific article; zbMATH DE number 550256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Study of a NP-hard cyclic scheduling problem: The recurrent job-shop |
scientific article; zbMATH DE number 550256 |
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
0 references
