Results 71 to 80 of about 3,286,488 (309)
Uma abordagem difusa para o problema de flow-shop scheduling [PDF]
, 1999 Tese (Doutorado) - Universidade Federal de Santa Catarina, Centro ...
Cury, Ricardo Martins
core
FEBS Letters, EarlyView.Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Proportionate Flow Shop Games [PDF]
In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines.By identifying jobs with agents, whose costs linearly depend on the completion time ...
Borm, P.E.M. +3 more
core
An improved constraint satisfaction adaptive neural network for job-shop scheduling [PDF]
, 2010 Copyright @ Springer Science + Business Media, LLC 2009This paper presents an improved constraint satisfaction adaptive neural network for job-shop scheduling problems.
Yang, S +11 more
core +1 more source
The human gut microbiome across the life course
FEBS Letters, EarlyView.Despite significant individual variation and continuous change throughout life, the human gut microbiome follows some life stage‐specific trends. This article provides a brief overview of how gut microbiome composition shifts across different phases of life. Created in BioRender. Özkurt, E. (2026) https://BioRender.com/8q4nrnc.
Alise J. Ponsero +4 more
wiley +1 more source
Applying Machine Based Decomposition in 2-Machine Flow Shops [PDF]
The Shifting Bottleneck (SB) heuristic is among the most successful approximation methods for solving the Job Shop problem. It is essentially a machine based decomposition procedure where a series of One Machine Sequencing Problems (OMSPs) are solved ...
Chatterjee Ashis K, Mukherjee, Saral
core
The Flow Shop problem with a server(带服务器的Flow Shop问题)
Zhejiang Daxue xuebao. Lixue ban, 2000 经典的Flow Shop问题是排序理论中一个得到广泛研究的问题。本文研究的是带服务器的Flow Shop问题。证明了F2,S∥Cmax是强NP-C的，并构造了一个渐近比为2的近似算法。此外，还讨论了它的两种多项式可解的条件。
SUChun-jie(苏纯洁) +1 more
doaj +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 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
A hybrid genetic approach to solve real make-to-order job shop scheduling problems [PDF]
, 1997 Tese (doutorado) - Universidade Federal de Santa Catarina, Centro TecnologicoProcedimentos de busca local (ex. busca tabu) e algoritmos genéticos têm apresentado excelentes resultados em problemas clássicos de programação da produção em ambientes job ...
Candido, Marco Antonio Barbosa
core