Meta-heuristic Task Scheduling Algorithm for Computing Cluster with 2D Packing Problem Approach-Reference-Cited by-同舟云学术

Meta-heuristic Task Scheduling Algorithm for Computing Cluster with 2D Packing Problem Approach

Published:2018-05-27 Issue: Volume: Page:74-82
ISSN:2194-5357
Container-title:Contemporary Complex Systems and Their Dependability
language:
Short-container-title:

Author:

Bożejko Wojciech,Chaczko Zenon,Nadybski Piotr,Wodecki Mieczysław

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-91446-6_8

Reference20 articles.

1. Bozoki, G., Richard, J.-P.: A branch-and-bound algorithm for the continous-process job-shop scheduling problem. AIIE Trans. 2(3), 246–252 (1970)

2. Błażewicz, J., Drabowski, M., Węglarz, J.: Scheduling multiprocessor tasks to minimize schedule length. IEEE Trans. Comput. 35(5), 389–393 (1986)

3. Błądek, I., Drozdowski, M., Guinand, F., Schepler, X.: On contiguous and non-contiguous parallel task scheduling. J. Sched. 18(5), 487–495 (2015)

4. Bożejko, W., Uchroński, M., Wodecki, M.: Block approach to the cyclic flow shop scheduling. Comput. Ind. Eng. 81, 158–166 (2015)

5. Bożejko, W., Nadybski, P., Wodecki, M.: Scheduling tasks for a computing cluster. In: Knosala, R. (ed.) Innovation in Management and Production Engineering, pp. 524–533. Publishing House of the Polish Society for Production Management (2017). ISBN 978-83-941281-1-1

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

1. QoS-Aware Dynamical Resource Scheduling in Cloud Data Centers;Security, Privacy, and Anonymity in Computation, Communication, and Storage;2021