The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (Q596087)
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: The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan |
scientific article; zbMATH DE number 2085506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan |
scientific article; zbMATH DE number 2085506 |
Statements
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan (English)
0 references
10 August 2004
0 references
Scheduling
0 references
Family
0 references
Batching
0 references
Makespan
0 references
0.9310356974601746
0 references
0.9049052000045776
0 references
0.9038292169570924
0 references
0.8608950972557068
0 references
