Results 191 to 200 of about 20,371,684 (241)

Association of Prodromal Parkinson's Disease-Like Features in Long COVID With Dream-Enactment Behaviours. [PDF]

J Sleep Res
Gong S, Liu Y, Huang B, Chan NY, Partinen E, Benedict C, Bjorvatn B, Merikanto I, De Gennaro L, Dauvilliers Y, Holzinger B, Yordanova J, Korman M, Reis C, Landtblom AM, Mota-Rolim S, Nadorff MR, Chung F, Inoue Y, Hrubos-Strøm H, Matsui K, Bolstad CJ, Xue P, Espie CA, Morin CM, Penzel T, Plazzi G, Partinen M, Wing YK.   +28 more
europepmc   +1 more source

Assessing the Value of Further Investment in R&D Using Mixed Methods: A Case Study of Biosensor-Integrated Arteriovenous Grafts. [PDF]

J Mark Access Health Policy
Owusu Achiaw S, Hawkins N, Wu O, Mercer J.   +3 more
europepmc   +1 more source

DRLO-VANET: a deep reinforcement learning-based offloading framework for low-latency and energy-efficient task execution in VANETs. [PDF]

Sci Rep
Neelima S, Sree SR, Ramakrishnaiah N.
europepmc   +1 more source

Software for weighted structured low-rank approximation

Markovsky, Ivan, Usevich, Konstantin
core   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Single machine lot scheduling to minimize the total weighted (discounted) completion time

Information Processing Letters, 2019
In this work, we investigate the problem of single machine lot scheduling where each lot contains one or more jobs and is of identical processing time. Jobs with different sizes are splittable and shall be processed in consecutive lots.
E. Zhang, Ming Liu, Feifeng Zheng, Yin-Feng Xu   +3 more
semanticscholar   +3 more sources

Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time

Applied Mathematics and Computation, 2006
Ji-Bo Wang, Shan Feng, Bo Jiang, Li-Yan Wang   +3 more
semanticscholar   +3 more sources

On scheduling of step-improving jobs to minimize the total weighted completion time

Journal of the Operational Research Society, 2023
Kim et al. (2022) studied single-machine scheduling of step-improving jobs with a common discount factor to minimize the total weighted completion time. This study proposes a pseudo-polynomial algorithm to solve the problem.
T. C. Edwin Cheng, Svetlana A. Kravchenko, B. M. Lin   +2 more
semanticscholar   +1 more source

Scheduling a maintenance activity to minimize total weighted completion-time [PDF]

Computers and Mathematics With Applications, 2009
We study a single machine scheduling problem. The processor needs to go through a maintenance activity, which has to be completed prior to a given deadline. The objective function is minimum total weighted completion time.
Gur Mosheiov, Assaf Sarig
exaly   +2 more sources

Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times

Journal of combinatorial optimization, 2021
Ji-Bo Wang, Bo Cui, P. Ji, Wei-Wei Liu
semanticscholar   +1 more source

Faster Minimization of Total Weighted Completion Time on Parallel Machines

arXiv.org
We study the classical problem of minimizing the total weighted completion time on a fixed set of $m$ identical machines working in parallel, the $Pm||\sum w_jC_j$ problem in the standard three field notation for scheduling problems. This problem is well
Danny Hermelin, Tomohiro Koana, D. Shabtay   +2 more
semanticscholar   +1 more source