The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.37.3.395 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3128332557 / rank | |||
Normal rank | |||
Revision as of 19:46, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Fixed Job Schedule Problem with Working-Time Constraints |
scientific article |
Statements
The Fixed Job Schedule Problem with Working-Time Constraints (English)
0 references
1989
0 references
working-time constraints
0 references
polynomial algorithm
0 references
fixed job schedule problem
0 references
NP-hard
0 references
preemptive case
0 references
lower bounds
0 references
maximum clique problem
0 references
dominance criteria
0 references
branch-and-bound
0 references
computational experiments
0 references
