Wyniki wyszukiwania dla: BATCH SCHEDULING

• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

  Publikacja

  • H. Furmańczyk
  • M. Kubale

  - Archives of Control Sciences - Rok 2015

  Pełny tekst do pobrania w serwisie zewnętrznym

• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

  Publikacja

  • H. Furmańczyk
  • M. Kubale

  - Archives of Control Sciences - Rok 2015

  In the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...

  Pełny tekst do pobrania w portalu

• JOURNAL OF SCHEDULING

  Czasopisma

  ISSN: 1094-6136 , eISSN: 1099-1425

• BatchI: Batch effect Identification in high-throughput screening data using a dynamic programming algorithm

  Publikacja

  • A. Papiez
  • M. Marczyk
  • J. Polanska
  • A. Polanski

  - BIOINFORMATICS - Rok 2019

  Pełny tekst do pobrania w serwisie zewnętrznym

• Shared processor scheduling

  Publikacja

  • D. Dereniowski
  • W. Kubiak

  - JOURNAL OF SCHEDULING - Rok 2018

  We study the shared processor scheduling problem with a single shared processor to maximize total weighted overlap, where an overlap for a job is the amount of time it is processed on its private and shared processor in parallel. A polynomial-time optimization algorithm has been given for the problem with equal weights in the literature. This paper extends that result by showing an (log)-time optimization algorithm for a class...

  Pełny tekst do pobrania w portalu

• Parallel scheduling by graph ranking

  Publikacja

  • D. Dereniowski

  - Rok 2006

  Nr dokum.: 73017Praca dotyczy jednego z nieklasycznych modeli kolorowania grafów - uporządkowanego kolorowania. Celem było uzyskanie wyników, które mogo być wykorzystane w praktycznych zastosowaniach tego modelu, do których należą: równoległe przetwarzanie zapytań w relacyjnych bazach danych, równoległa faktoryzacja macierzy metodą Choleskiego, równoległa asemblacja produktu z jego części składowych. W pracy wskazano uogólnienia...

• Shared multi-processor scheduling

  Publikacja

  • D. Dereniowski
  • W. Kubiak

  - EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - Rok 2017

  We study shared multi-processor scheduling problem where each job can be executed on its private processor and simultaneously on one of many processors shared by all jobs in order to reduce the job’s completion time due to processing time overlap. The total weighted overlap of all jobs is to be maximized. The problem models subcontracting scheduling in supply chains and divisible load scheduling in computing. We show that synchronized...

  Pełny tekst do pobrania w serwisie zewnętrznym

• Restricted open shop scheduling

  Publikacja

  • M. Małafiejski
  • K. Pastuszak

  - Journal of Theoretical and Applied Computer Science - Rok 2017

  In the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....

  Pełny tekst do pobrania w serwisie zewnętrznym

• Media Watch

  Czasopisma

  ISSN: 2249-8818 , eISSN: 0976-0911

• Scheduling of compatible jobs on parallel machines

  Publikacja

  • T. Pikies

  - 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...