Wyniki wyszukiwania dla: FPT - MOST Wiedzy

Wyszukiwarka

Wyniki wyszukiwania dla: FPT

Wyniki wyszukiwania dla: FPT

  • A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem

    In this paper a single machine time-dependent scheduling problem with total completion time criterion is considered. There are given n jobs J1,…,Jn and the processing time pi of the ith job is given by pi=a+bisi, where si is the starting time of the ith job (i=1,…,n),bi is its deterioration rate and a is the common base processing time. If all jobs have deterioration rates different and not smaller than a certain constant u>0,...

    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

  • The Effects of Pin Profile on HDPE Thermomechanical Phenomena during FSW

    Publikacja

    - Polymers - Rok 2022

    Friction stir welding (FSW) of polymeric materials has recently attracted significant attention. Herein, we present the effect of the tool pin profile on the FSW of high-density polyethylene (HDPE) joints through joint experimental analysis and thermomechanical simulations. For analysis of pin profile effects on the thermomechanical properties of HDPE joints, frustum (FPT), cubic (CPT), and triangular (TPT) pin shapes were selected...

    Pełny tekst do pobrania w portalu

  • Multi-agent graph searching and exploration algorithms

    Publikacja

    - Rok 2020

    A team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...

    Pełny tekst do pobrania w portalu