Results 61 to 70 of about 129,345 (335)

No-idle, no-wait: when shop scheduling meets dominoes, eulerian and hamiltonian paths [PDF]

open access: yesarXiv, 2017
In shop scheduling, several applications exist where it is required that some components perform consecutively. We refer to no-idle schedules if machines are required to operate with no inserted idle time and no-wait schedules if tasks cannot wait between the end of an operation and the start of the following one.
arxiv  

Surfaceome: a new era in the discovery of immune evasion mechanisms of circulating tumor cells

open access: yesMolecular Oncology, EarlyView.
In the era of immunotherapies, many patients either do not respond or eventually develop resistance. We propose to pave the way for proteomic analysis of surface‐expressed proteins called surfaceome, of circulating tumor cells. This approach seeks to identify immune evasion mechanisms and discover potential therapeutic targets. Circulating tumor cells (
Doryan Masmoudi   +3 more
wiley   +1 more source

A Simultaneous Worker Assignment and Scheduling Problem to Minimize Makespan in Flexible Flow Shop via Metaheuristic Approaches [PDF]

open access: yesInternational Journal of Industrial Engineering and Production Research, 2019
In many real scheduling situations, it is necessary to deal with the worker assignment and job scheduling together. However, in traditional scheduling problems, only the machine is assumed to be a constraint and there isn’t any constraint about workers ...
Ebrahim Asadi-Gangraj   +2 more
doaj   +1 more source

Reinforcement Learning based Condition-oriented Maintenance Scheduling for Flow Line Systems [PDF]

open access: yesarXiv, 2021
Maintenance scheduling is a complex decision-making problem in the production domain, where a number of maintenance tasks and resources has to be assigned and scheduled to production entities in order to prevent unplanned production downtime. Intelligent maintenance strategies are required that are able to adapt to the dynamics and different conditions
arxiv  

Circulating tumor cells in metastatic breast cancer patients treated with immune checkpoint inhibitors – a biomarker analysis of the ALICE and ICON trials

open access: yesMolecular Oncology, EarlyView.
In this explorative biomarker analysis, we assessed serial sampling of circulating tumor cells (CTCs) with CellSearch in two randomized trials testing immune checkpoint inhibitors (ICIs) in metastatic breast cancer. Our data demonstrate a prognostic potential of CTCs, most apparent 4 weeks into ICI therapy.
Nikolai Kragøe Andresen   +13 more
wiley   +1 more source

Cell‐free and extracellular vesicle microRNAs with clinical utility for solid tumors

open access: yesMolecular Oncology, EarlyView.
Cell‐free microRNAs (cfmiRs) are small‐RNA circulating molecules detectable in almost all body biofluids. Innovative technologies have improved the application of cfmiRs to oncology, with a focus on clinical needs for different solid tumors, but with emphasis on diagnosis, prognosis, cancer recurrence, as well as treatment monitoring.
Yoshinori Hayashi   +6 more
wiley   +1 more source

The Effectiveness of Genetic Algorithm, And the CDS Method In Solving Flowshop Scheduling Problems [PDF]

open access: yesE3S Web of Conferences
Flow shop scheduling problem is considered NP-hard for m machines and n jobs. For such NP-hard combinatorial optimization problems, heuristics play a major role in searching for near-optimal solutions. In this paper we used Genetic Algorithm, and the CDS
Prassetiyo Hendro, Heryati Firda
doaj   +1 more source

Flow-time Optimization For Concurrent Open-Shop and Precedence Constrained Scheduling Models [PDF]

open access: yesarXiv, 2018
Scheduling a set of jobs over a collection of machines is a fundamental problem that needs to be solved millions of times a day in various computing platforms: in operating systems, in large data clusters, and in data centers. Along with makespan, flow-time, which measures the length of time a job spends in a system before it completes, is arguably the
arxiv  

A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes [PDF]

open access: yesarXiv, 2020
We consider the routing flow shop problem with two machines on an asymmetric network. For this problem we discuss properties of an optimal schedule and present a polynomial time algorithm assuming the number of nodes of the network to be bounded by a constant.
arxiv  

On‐treatment dynamics of circulating extracellular vesicles in the first‐line setting of patients with advanced non‐small cell lung cancer: the LEXOVE prospective study

open access: yesMolecular Oncology, EarlyView.
The LEXOVE prospective study evaluated plasma cell‐free extracellular vesicle (cfEV) dynamics using Bradford assay and dynamic light scattering in metastatic non‐small cell lung cancer patients undergoing first‐line treatments, correlating a ∆cfEV < 20% with improved median progression‐free survival in responders versus non‐responders.
Valerio Gristina   +17 more
wiley   +1 more source

Home - About - Disclaimer - Privacy