Results 71 to 80 of about 8,566,720 (303)
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To characterize the demographic, clinical, and laboratory features of the Chinese patients of genetic Creutzfeldt‐Jakob disease with T188K variant (T188K‐gCJD), the most common subtype of genetic prion diseases (gPrDs) in China. Methods In this nationwide retrospective study, data from 98 genetically confirmed T188K‐gCJD patients ...
Chun‐Jie Li +11 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
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Building on our prior Behavioral Risk Factor Surveillance System analysis identifying adults aged 18–39 as the primary driver of the national increase in self‐reported cognitive disability, we examined factors associated with this rise using 2013–2024 U.S. BRFSS data. Methods We analyzed U.S.
Adam de Havenon +9 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
A New One-Machine Decomposition Technique for Solving the Permutation Flow-Shop Scheduling Problem
AlgorithmsExisting metaheuristics for the permutation flow-shop scheduling problem primarily explore the search space directly. This study presents a new decomposition technique that, unlike those methods, repeatedly solves one-machine subproblems and extends ...
Mehrdad Amirghasemi +4 more
doaj +1 more source
Non-permutation flow shop scheduling problem with preemption-dependent processing time
Cogent Engineering, 2016 In this paper, the non-permutation flow shop scheduling problem with preemption-dependent processing times is considered. A mixed integer programming formulation is proposed to tackle the problem. The optimization objective considered is the minimization
Mohsen Ziaee, Hossein Karimi
doaj +1 more source
Batch Scheduling In A Two-Stage Flexible Flow Shop Problem
Foundations of Computing and Decision Sciences, 2014 We study a special two-stage flexible flowshop, which consists of several parallel identical machines in the first stage and a single machine in the second stage.
Gerstl Enrique +2 more
doaj +1 more source
IEEE Access, 2020 The classical hybrid flow shop scheduling problem (HFSP) only treats machines as the only resource constraint, ignoring the dominant role of workers in production and manufacturing.
Kaifeng Geng, Chunming Ye, Li Liu
doaj +1 more source
Progressive Parkinsonism in PPP2R5D‐Related Neurodevelopmental Disorder
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT PPP2R5D‐related neurodevelopmental disorder (Houge–Janssens syndrome type 1) is a rare autosomal dominant condition characterized by macrocephaly, intellectual disability, and epilepsy. Progressive parkinsonism is an emerging adult phenotype that neurologists should be aware of since timely genetic diagnosis opens the door to disease‐modifying
Katerina Bernardi +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