Results 51 to 60 of about 246,867 (304)

In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS

open access: yesFEBS Letters, EarlyView.
We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka   +11 more
wiley   +1 more source

Cell wall target fragment discovery using a low‐cost, minimal fragment library

open access: yesFEBS Letters, EarlyView.
LoCoFrag100 is a fragment library made up of 100 different compounds. Similarity between the fragments is minimized and 10 different fragments are mixed into a single cocktail, which is soaked to protein crystals. These crystals are analysed by X‐ray crystallography, revealing the binding modes of the bound fragment ligands.
Kaizhou Yan   +5 more
wiley   +1 more source

Flexible job-shop scheduling problem with parallel batch machines based on an enhanced multi-population genetic algorithm

open access: yesComplex & Intelligent Systems
The flexible job-shop scheduling problem (FJSP) with parallel batch processing machine (PBM) is one of those long-standing issues that needs cutting-edge approaches. It is a recent extension of standard flexible job shop scheduling problems.
Lirui Xue   +3 more
doaj   +1 more source

The (Glg)ABCs of cyanobacteria: modelling of glycogen synthesis and functional divergence of glycogen synthases in Synechocystis sp. PCC 6803

open access: yesFEBS Letters, EarlyView.
We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee   +3 more
wiley   +1 more source

Scheduling of job shop, make-to-order industries with recirculation and assembly: discrete versus continuous time models [PDF]

open access: yes, 2009
This work studies the performance of two Mixed Integer Linear Programming (MILP) models to solve scheduling problems in a flexible job shop environment with recirculation and assembly using a due-date-based objective function. The models convey different
Barbosa-Póvoa, Ana Paula   +2 more
core  

An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem [PDF]

open access: yes, 2015
The flexible job shop scheduling problem (FJSP) is vital to manufacturers especially in today’s constantly changing environment. It is a strongly NP-hard problem and therefore metaheuristics or heuristics are usually pursued to solve it.
A Baykasoglu   +31 more
core   +1 more source

Discrepancy search for the flexible job shop scheduling problem [PDF]

open access: yesComputers & Operations Research, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ben Hmida, Abir   +3 more
openaire   +2 more sources

Structural biology of ferritin nanocages

open access: yesFEBS Letters, EarlyView.
Ferritin is a conserved iron‐storage protein that sequesters iron as a ferric mineral core within a nanocage, protecting cells from oxidative damage and maintaining iron homeostasis. This review discusses ferritin biology, structure, and function, and highlights recent cryo‐EM studies revealing mechanisms of ferritinophagy, cellular iron uptake, and ...
Eloise Mastrangelo, Flavio Di Pisa
wiley   +1 more source

Pull-Based Output Rate Control of a Flexible Job Shop in a Multi-Shop Production Chain

open access: yesMathematics
This paper addresses the problem where optimizing a single production shop within a production chain may not improve the overall performance of the entire chain.
Wei Weng, Meimei Zheng, Jiuchun Ren
doaj   +1 more source

Flexible job shop scheduling using genetic algorithm and heuristic rules

open access: yesJournal of Advanced Mechanical Design, Systems, and Manufacturing, 2016
Job shop scheduling with the availability of more than one machine to perform an operation, also known as the flexible job shop scheduling problem, is computationally NP-hard.
Parinya KAWEEGITBUNDIT, Toru EGUCHI
doaj   +1 more source

Home - About - Disclaimer - Privacy