Wyniki wyszukiwania dla: UNRELATED MACHINE - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: UNRELATED MACHINE

Filtry

wszystkich: 6

wyczyść wszystkie filtry


Filtry wybranego katalogu

  • Kategoria

  • Rok

  • Opcje

wyczyść Filtry wybranego katalogu niedostępne

Wyniki wyszukiwania dla: UNRELATED MACHINE

  • Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs

    Publikacja

    - Rok 2022

    The problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Approximation algorithms for job scheduling with block-type conflict graphs

    Publikacja

    - COMPUTERS & OPERATIONS RESEARCH - Rok 2024

    The problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Total Completion Time Minimization for Scheduling with Incompatibility Cliques

    Publikacja

    - Rok 2021

    This paper considers parallel machine scheduling with incompatibilities between jobs. The jobs form a graph equivalent to a collection of disjoint cliques. No two jobs in a clique are allowed to be assigned to the same machine. Scheduling with incompatibilities between jobs represents a well-established line of research in scheduling theory and the case of disjoint cliques has received increasing attention in recent...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines

    Publikacja

    In this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms

    Publikacja

    - ARTIFICIAL INTELLIGENCE - Rok 2022

    In this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...

    Pełny tekst do pobrania w serwisie zewnętrznym

  • Scheduling of compatible jobs on parallel machines

    Publikacja

    - Rok 2021

    The dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...