Results 61 to 70 of about 7,150,473 (243)

A branch-and-bound algorithm for stable scheduling in single-machine production systems. [PDF]

open access: yes
Robust scheduling aims at the construction of a schedule that is protected against uncertain events. A stable schedule is a robust schedule that will change little when variations in the input parameters arise.
Herroelen, Willy, Leus, Roel
core  

Learning labelled dependencies in machine translation evaluation [PDF]

open access: yes, 2009
Recently novel MT evaluation metrics have been presented which go beyond pure string matching, and which correlate better than other existing metrics with human judgements.
He, Yifan, Way, Andy
core   +2 more sources

A Batching Machine Model for Lot Scheduling on a Single Machine

open access: yesFoundations of Computing and Decision Sciences, 2018
A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized.
Kovalyov Mikhail Y.
doaj   +1 more source

Autophagy and mitophagy in pancreatic β‐cell homeostasis and their involvement in diabetes pathophysiology

open access: yesFEBS Letters, EarlyView.
This review focuses on the role of autophagy and mitophagy in maintaining pancreatic β‐cell function and homeostasis. We discuss how genetic defects affecting these pathways contribute to the development of type 1, type 2, monogenic, and gestational diabetes. We further explore their potential as therapeutic targets. Created in BioRender.
Yunkyeong Lee   +2 more
wiley   +1 more source

Golgi enzymes are retrieved from the plasma membrane to the trans‐Golgi network

open access: yesFEBS Letters, EarlyView.
Golgi enzymes are traditionally considered resident proteins retained within the Golgi apparatus. Here, we demonstrate that a subset transiently reaches the cell surface and is subsequently retrieved to the trans‐Golgi network via retrograde transport. Using a nanobody‐based toolkit, we uncover a dynamic trafficking cycle of several Golgi enzymes.
Dominik P. Buser, Tina Junne
wiley   +1 more source

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

open access: yesFEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri   +5 more
wiley   +1 more source

Greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness penalties [PDF]

open access: yes
In this paper, we present greedy randomized dispatching heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. The several heuristic versions differ, on the one hand, on the strategies
Maria R. A. Moreira, Jorge M. S. Valente
core  

Scheduling Job Families on a Single Machine

open access: yesمجلة بغداد للعلوم, 2010
The problem of scheduling n jobs on a single machine is considered, where the jobs are partitioned into several families and a set – up time is necessary between jobs of different families.
Adawiyah A. Mahmood, Naji M. Saheab
doaj   +1 more source

Emerging experimental and computational methods for studying redox‐regulated structural transitions

open access: yesFEBS Letters, EarlyView.
Redox reactions can reshape proteins and alter how they behave in cells, with important consequences for health and disease. This review explores emerging experimental and computational approaches for discovering these redox‐sensitive protein switches, revealing their structural effects, and predicting their behavior, opening new opportunities to ...
Tasneem Rass   +2 more
wiley   +1 more source

Beam search heuristics for the single machine scheduling problem with linear earliness and quadratic tardiness costs [PDF]

open access: yes
In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs, and no machine idle time. We present heuristic algorithms based on the beam search technique.
Jorge M. S. Valente
core  

Home - About - Disclaimer - Privacy