Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (Q1969830)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan |
scientific article; zbMATH DE number 1417438
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan |
scientific article; zbMATH DE number 1417438 |
Statements
Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan (English)
0 references
30 January 2001
0 references
scheduling theory
0 references
branch and bound
0 references
parallel machines
0 references
makespan
0 references
0 references
0 references
0 references
