Results 61 to 70 of about 3,286,488 (310)
Constraint satisfaction adaptive neural network and heuristics combined approaches for generalized job-shop scheduling [PDF]
Copyright @ 2000 IEEEThis paper presents a constraint satisfaction adaptive neural network, together with several heuristics, to solve the generalized job-shop scheduling problem, one of NP-complete constraint satisfaction problems.
Yang, S +3 more
core +1 more source
ABSTRACT Background Patients with chronic kidney disease undergoing hemodialysis commonly experience reduced physical function, fatigue, poor sleep quality, and impaired health‐related quality of life. Intradialytic exercise has been proposed as a non‐pharmacological strategy to improve these outcomes.
Klebson da Silva Almeida +6 more
wiley +1 more source
The flow-shop scheduling problem (FSP) has been widely studied in the literature and having a very active research area. Over the last few decades, a number of heuristic/meta-heuristic solution techniques have been developed.
Arun Gupta, Shailendra Kumar
doaj +1 more source
ABSTRACT Background Establishing a comprehensive apheresis medicine program in a resource‐constrained setting presents significant structural, financial, and logistical challenges. Despite the growing clinical importance of apheresis services globally, published experience from sub‐Saharan Africa remains sparse.
Folasade Adelekan‐Popoola +4 more
wiley +1 more source
Uma abordagem difusa para o problema de flow-shop scheduling [PDF]
Tese (Doutorado) - Universidade Federal de Santa Catarina, Centro ...
Cury, Ricardo Martins
core
ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +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]
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
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
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

