Wyniki wyszukiwania dla: SMART SCHEDULING

• JOURNAL OF SCHEDULING

  Czasopisma

  ISSN: 1094-6136 , eISSN: 1099-1425

• Guest editorial: learning, scheduling, resource optimization, and evolution in smart artificial systems: challenges and support

  Publikacja

  • E. Szczerbicki
  • C. Orłowski

  - CYBERNETICS AND SYSTEMS - Rok 2012

  ...

• SMART MATERIALS & STRUCTURES

  Czasopisma

  ISSN: 0964-1726 , eISSN: 1361-665X

• 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

• 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

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

• Smart Health

  Czasopisma

  ISSN: 2352-6483

• Smart Science

  Czasopisma

  ISSN: 2308-0477

• Smart Agriculture

  Czasopisma

  ISSN: 2096-8094