Now showing items 1-4 of 4

  • A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems 

    Zhai, Yingni; Liu, Changjun; Chu, Wei; Guo, Ruifeng; Liu, Cunliang (OmniaScience, 2014-12)
    Article
    Open Access
    Purpose: A decomposition heuristics based on multi-bottleneck machines for large-scale job shop scheduling problems (JSP) is proposed. Design/methodology/approach: In the algorithm, a number of sub-problems are constructed ...
  • A static benchmarking for grid scheduling problems 

    Xhafa Xhafa, Fatos; Barolli, Leonard; Gonzalez S, Juan Antonio; Jura, Pawel (Institute of Electrical and Electronics Engineers (IEEE), 2009)
    Conference report
    Open Access
    Analysis of algorithms for Grid computing systems before deployment in real Grid infrastructures is an important issue in Grid computing domain. Due to the complexity of real Grid systems, assessing performance analysis ...
  • Graph-partitioning based instruction scheduling for clustered processors 

    Aleta Ortega, Alexandre; Codina Viñas, Josep M.; Sánchez Navarro, F. Jesús; González Colás, Antonio María (Institute of Electrical and Electronics Engineers (IEEE), 2001)
    Conference report
    Open Access
    This paper presents a novel scheme to schedule loops for clustered microarchitectures. The scheme is based on a preliminary cluster assignment phase implemented through graph partitioning techniques followed by a scheduling ...
  • Work-in-Progress Paper: An Analysis of the Impact of Dependencies on Probabilistic Timing Analysis and Task Scheduling 

    Mezzetti, Enrico; Abella, Jaume; Hernandez, Carles; Cazorla, Francisco J. (IEEE, 2018-02-01)
    Conference lecture
    Open Access
    Recently there has been a renewed interest for probabilistic timing analysis (PTA) and probabilistic task scheduling (PTS). Despite the number of works in both fields, the link between them is weak: works on the latter ...