Study of a NP-hard cyclic scheduling problem: The recurrent job-shop (Q1319564): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90332-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042541831 / rank | |||
Normal rank | |||
Revision as of 00:43, 20 March 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
