Approximation algorithms for parallel machine scheduling with speed-up resources
Chen, Lin and Ye, D and Zhang, G (2016) Approximation algorithms for parallel machine scheduling with speed-up resources. In: 19th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2016 and the 20th International Workshop on Randomization and Computation, RANDOM 2016. Leibniz International Proceedings in Informatics, LIPIcs (60). Schloss Dagstuhl Leibniz-Zentrum für Informatik, Dagstuhl, 5:1-5:12. ISBN 9783959770187 10.4230/LIPIcs.APPROX-RANDOM.2016.5
|
Text
Chen_5_3173768_ny.pdf Download (434kB) | Preview |
| Item Type: | Book Section |
|---|---|
| Uncontrolled Keywords: | Unrelated machines; Two parameter; Processing Time; Polynomial time approximation schemes; Parallel machine scheduling; Machine assignment; Job assignments; Identical machines; Random processes; Polynomial approximation; Optimization; MACHINERY; Combinatorial optimization; Scheduling; Linear programming; Approximation algorithms |
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Informatics Laboratory |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 29 Jan 2017 20:27 |
| Last Modified: | 21 Jul 2019 14:04 |
| URI: | https://eprints.sztaki.hu/id/eprint/9034 |
 |
Update Item |
