Results 71 to 80 of about 85,049 (338)
IEEE Access, 2018 Blocking flow shop scheduling problem has been extensively studied because of its widespread industrial applications. However, the existing research mostly aims at makespan or total flow time minimization and ignores the criterion for energy saving. This
Fucai Wang +3 more
doaj +1 more source
Molecular Oncology, EarlyView.B‐cell chronic lymphocytic leukemia (B‐CLL) and monoclonal B‐cell lymphocytosis (MBL) show altered proteomes and phosphoproteomes, analyzed using mass spectrometry, protein microarrays, and western blotting. Identifying 2970 proteins and 316 phosphoproteins, including 55 novel phosphopeptides, we reveal BCR and NF‐kβ/STAT3 signaling in disease ...
Paula Díez +17 more
wiley +1 more source
On Two-machine Flow Shop Scheduling [PDF]
Journal of the Operations Research Society of China, 2014 In this note, we revisit the classical two-machine flow shop scheduling problem. A linear time approximation scheme is presented. For an online version with rejection, we propose best possible online algorithms.
Guochuan Zhang, Lin Chen, Wenchang Luo
openaire +2 more sources
Realization of an Optimal Schedule for the Two-machine Flow-Shop with Interval Job Processing Times [PDF]
, 2007 Non-preemptive two-machine flow-shop scheduling problem with uncertain processing times of n jobs is studied. In an uncertain version of a scheduling problem, there may not exist a unique schedule that remains optimal for all possible realizations of the
Leshchenko, Natalja, Sotskov, Yuri
core
TRPM8 levels determine tumor vulnerability to channel agonists
Molecular Oncology, EarlyView.TRPM8 is a Ca2+ permissive channel. Regardless of the amount of its transcript, high levels of TRPM8 protein mark different tumors, including prostate, breast, colorectal, and lung carcinomas. Targeting TRPM8 with channel agonists stimulates inward calcium currents followed by emptying of cytosolic Ca2+ stores in cancer cells.
Alessandro Alaimo +18 more
wiley +1 more source
A Simultaneous Worker Assignment and Scheduling Problem to Minimize Makespan in Flexible Flow Shop via Metaheuristic Approaches [PDF]
International 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
Resource Speed Optimization for Two-Stage Flow-Shop Scheduling [PDF]
, 2015 Multiple resource co-scheduling algorithms and pipelined execution models are becoming increasingly popular, as they better capture the heterogeneous nature of modern architectures.
Alessandra Melani +4 more
core
Molecular Oncology, EarlyView.The COMBAT classification system, developed through multi‐omics integration, stratifies adult patients with B‐cell acute lymphoblastic leukemia(B‐ALL) into three molecular subtypes with distinct surface antigen patterns, immune landscape, methylation patterns, biological pathways and prognosis.
Yang Song +11 more
wiley +1 more source
Sequencing CONWIP flow-shops: Analysis and heuristics [PDF]
In this paper, we address the backlog sequencing problem in a flow-shop controlled by a CON\VIP production control system with the objective to minimise the make span We characterise the problem and analyse its similarities and differences with the ...
Framiúnan, Jose M. +2 more
core
New efficient constructive heuristics for the hybrid flowshop to minimise makespan: A computational evaluation of heuristics [PDF]
, 2018 This paper addresses the hybrid flow shop scheduling problem to minimise makespan, a well-known scheduling problem for which many constructive heuristics have been proposed in the literature. Nevertheless, the state of the art is not clear due to partial
Fernández-Viagas Escudero, Víctor +2 more
core