Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An exact algorithm for scheduling identical coupled tasks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Scheduling of coupled tasks with unit processing times / 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: On the complexity of coupled-task scheduling / rank | |||
Normal rank | |||
Revision as of 04:25, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks |
scientific article |
Statements
Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (English)
0 references
13 May 2012
0 references
polynomial-time algorithm
0 references
scheduling
0 references
coupled-tasks
0 references
matching
0 references
