Results 51 to 60 of about 1,249,401 (374)
Population Ecology, EarlyView.Population size and dynamics fundamentally shape speciation by influencing genetic drift, founder events, and adaptive potential. Small populations may speciate rapidly due to stronger drift, whereas large populations harbor more genetic diversity, which can alter divergence trajectories. We highlight theoretical models that incorporate population size
Ryo Yamaguchi +3 more
wiley +1 more source
Job Shop Scheduling by Simulated Annealing [PDF]
Operations Research, 1992 We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems.
Jan Karel Lenstra +2 more
openaire +2 more sources
Genetic algorithm and neural network hybrid approach for job-shop scheduling [PDF]
, 1998 Copyright @ 1998 ACTA PressThis paper proposes a genetic algorithm (GA) and constraint satisfaction adaptive neural network (CSANN) hybrid approach for job-shop scheduling problems.
Wang, D, Yang, S, Zhao, K
core
Exploring lipid diversity and minimalism to define membrane requirements for synthetic cells
FEBS Letters, EarlyView.Designing the lipid membrane of synthetic cells is a complex task, in which its various roles (among them solute transport, membrane protein support, and self‐replication) should all be integrated. In this review, we report the latest top‐down and bottom‐up advances and discuss compatibility and complexity issues of current engineering approaches ...
Sergiy Gan +2 more
wiley +1 more source
On the Job-Shop Scheduling Problem [PDF]
Operations Research, 1960 This is a proposal for the application of discrete linear programming to the typical job-shop scheduling problem—one that involves both sequencing restrictions and also noninterference constraints for individual pieces of equipment. Thus far, no attempt has been made to establish the computational feasibility of the approach in the case of large-scale
openaire +2 more sources
A branch and bound and simulated annealing approach for job shop scheduling [PDF]
, 2004 This paper presents two approaches to the solution of the job shop scheduling problem, namely the branch and bound, and simulated annealing approach. The objective is to schedule the jobs on the machines so that the total completion time is minimized. In
Salim, Sutinah, Tan, Hui Woon
core
Job shop control:in search of the key to delivery improvements [PDF]
, 2015 The last major performance breakthroughs in job shop control stem from the 1980s and 1990s. We generate a new search direction for designing job shop control policies, providing a key to delivery improvements.
Gaalman, Gerard J. C. +3 more
core +2 more sources
FEBS Letters, EarlyView.Spinal muscular atrophy (SMA) is a genetic disease affecting motor neurons. Individuals with SMA experience mitochondrial dysfunction and oxidative stress. The aim of the study was to investigate the effect of an antioxidant and neuroprotective substance, ergothioneine (ERGO), on an SMNΔ7 mouse model of SMA.
Francesca Cadile +8 more
wiley +1 more source
An Improved Shuffled Frog-Leaping Algorithm for Flexible Job Shop Scheduling Problem
Algorithms, 2015 The flexible job shop scheduling problem is a well-known combinatorial optimization problem. This paper proposes an improved shuffled frog-leaping algorithm to solve the flexible job shop scheduling problem. The algorithm possesses an adjustment sequence
Kong Lu +5 more
doaj +1 more source
A MILP model for an extended version of the Flexible Job Shop Problem [PDF]
, 2014 A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arbitrary directed acyclic graph rather than a linear order.
Birgin, Ernesto G. +5 more
core +2 more sources