Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks (Q2883631): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
(6 intermediate revisions by 5 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.endm.2010.05.082 / rank | |||
Property / author | |||
Property / author: Jean-Claude Konig / rank | |||
Property / author | |||
Property / author: Jean-Claude Konig / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1996979574 / rank | |||
Normal rank | |||
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 | |||
Property / DOI | |||
Property / DOI: 10.1016/J.ENDM.2010.05.082 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 02:53, 20 December 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