The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (Q924888)
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 bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan |
scientific article; zbMATH DE number 5280657
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan |
scientific article; zbMATH DE number 5280657 |
Statements
The bounded single-machine parallel-batching scheduling problem with family jobs and release dates to minimize makespan (English)
0 references
29 May 2008
0 references
single-machine scheduling
0 references
worst-case analysis
0 references
approximation algorithm
0 references
family
0 references
batching
0 references
0 references
