A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (Q2699097)
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 7678882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions |
scientific article; zbMATH DE number 7678882 |
Statements
A linear time approximation scheme for scheduling unbounded batch machines with delivery times and inclusive processing set restrictions (English)
0 references
26 April 2023
0 references
scheduling
0 references
unbounded batch machines
0 references
inclusive processing set restrictions
0 references
maximum delivery completion time
0 references
polynomial time approximation scheme
0 references
0 references
0 references
0 references
0 references
0.8350697159767151
0 references
0.8286558389663696
0 references
0.8283877372741699
0 references
0.8237938284873962
0 references
