Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7341855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Single machine batch scheduling with two non-disjoint agents and splitable jobs |
scientific article; zbMATH DE number 7341855 |
Statements
Single machine batch scheduling with two non-disjoint agents and splitable jobs (English)
0 references
3 May 2021
0 references
parallel-batch
0 references
splitable jobs
0 references
Pareto optimal
0 references
polynomial-time algorithm
0 references
0 references
0 references
0 references
0 references
0.8546048402786255
0 references
0.847996175289154
0 references
0.8476734757423401
0 references
0.8433079719543457
0 references
