On the complexity of coupled-task scheduling (Q5961610): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Shop Problems With Two Machines and Time Lags / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: `` Strong '' NP-Completeness Results / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the median / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling coupled tasks / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966465131 / rank | |||
Normal rank | |||
Latest revision as of 08:49, 30 July 2024
scientific article; zbMATH DE number 981907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the complexity of coupled-task scheduling |
scientific article; zbMATH DE number 981907 |
Statements
On the complexity of coupled-task scheduling (English)
0 references
25 February 1997
0 references
coupled-task
0 references
sequencing
0 references
single machine
0 references
makespan
0 references
NP-hardness
0 references
polynomial algorithms
0 references
