Scheduling with processing set restrictions: PTAS results for several variants-Reference-Cited by-同舟云学术

Scheduling with processing set restrictions: PTAS results for several variants

Published:2011-10 Issue:2 Volume:133 Page:586-595
ISSN:0925-5273
Container-title:International Journal of Production Economics
language:en
Short-container-title:International Journal of Production Economics

Author:

Epstein Leah,Levin Asaf

Publisher

Elsevier BV

Subject

Industrial and Manufacturing Engineering,Management Science and Operations Research,Economics and Econometrics,General Business, Management and Accounting

Reference23 articles.

1. Approximation schemes for scheduling on parallel machines;Alon;Journal of Scheduling,1998

2. The competitiveness of on-line assignments;Azar;Journal of Algorithms,1995

3. On-line load balancing in a hierarchical server topology;Bar-Noy;SIAM Journal on Computing,2001

4. Ebenlendr, T., Krčál, M., Sgall, J., 2008. Graph balancing: a special case of scheduling unrelated parallel machines. In: Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA2008), pp. 483–490.

5. Parallel machine scheduling with job assignment restrictions;Glass;Naval Research Logistics,2007

Cited by 26 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Response Time Analysis of Parallel Tasks under Global Fixed-priority on Heterogeneous Multi-cores;2022 China Automation Congress (CAC);2022-11-25

2. Approximation algorithms for batch scheduling with processing set restrictions;Journal of Scheduling;2022-03-05

3. Parallel-machine scheduling in shared manufacturing;Journal of Industrial & Management Optimization;2022

4. Scheduling uniform machines with restricted assignment;Mathematical Biosciences and Engineering;2022

5. Structural parameters for scheduling with assignment restrictions;Theoretical Computer Science;2020-12